Shuo Pang

According to our database, Shuo Pang authored at least 7 papers between 2020 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Lower Bounds for CSP Hierarchies Through Ideal Reduction.

Jonas Conneryd, Yassine Ghannane, Shuo Pang

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.

Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis.

Ilias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.

Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021

Large Clique is Hard on Average for Resolution.

Shuo Pang

Proceedings of the Computer Science - Theory and Applications, 2021

SOS Lower Bound for Exact Planted Clique.

Shuo Pang

Proceedings of the 36th Computational Complexity Conference, 2021

2020

On CDCL-Based Proof Systems with the Ordered Decision Strategy.

Nathan Mull, Shuo Pang, Alexander A. Razborov

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020