Shuo Pang

16 papers A* 4A 2Misc 1Journal 9
YearRankTypeTitle / Venue / Authors
2026 A* conf
Lower Bounds for CSP Hierarchies Through Ideal Reduction.
SODA
Jonas Conneryd, Yassine Ghannane, Shuo Pang
2025 J jnl
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
CoRR
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025 J jnl
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
Electron. Colloquium Comput. Complex.
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2025 J jnl
Lower Bounds for CSP Hierarchies Through Ideal Reduction.
CoRR
Jonas Conneryd, Yassine Ghannane, Shuo Pang
2025 A* conf
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
STOC
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024 A* conf
Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis.
FOCS
Ilias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin
2024 J jnl
Sum-of-squares lower bounds for Non-Gaussian Component Analysis.
CoRR
Ilias Diakonikolas, Sushrut Karmalkar, Shuo Pang, Aaron Potechin
2024 J jnl
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
CoRR
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2024 J jnl
Truly Supercritical Trade-offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler-Leman.
Electron. Colloquium Comput. Complex.
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang
2023 A* conf
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
FOCS
Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse
2022 J jnl
On CDCL-Based Proof Systems with the Ordered Decision Strategy.
SIAM J. Comput.
Nathan Mull, Shuo Pang, Alexander A. Razborov
2021 Misc conf
Large Clique is Hard on Average for Resolution.
CSR
Shuo Pang
2021 A conf
SOS Lower Bound for Exact Planted Clique.
CCC
Shuo Pang
2020 A conf
On CDCL-Based Proof Systems with the Ordered Decision Strategy.
SAT
Nathan Mull, Shuo Pang, Alexander A. Razborov
2019 J jnl
Large Clique is Hard on Average for Resolution.
Electron. Colloquium Comput. Complex.
Shuo Pang
2019 J jnl
On CDCL-based proof systems with the ordered decision strategy.
CoRR
Nathan Mull, Shuo Pang, Alexander A. Razborov