Shuo Pang

According to our database, Shuo Pang authored at least 6 papers between 2019 and 2025.

Collaborative distances:

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

2025

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

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

Electron. Colloquium Comput. Complex., 2025

2024

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

Electron. Colloquium Comput. Complex., 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

2022

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

Nathan Mull, Shuo Pang, Alexander A. Razborov

SIAM J. Comput., August, 2022

2021

SOS Lower Bound for Exact Planted Clique.

Shuo Pang

Proceedings of the 36th Computational Complexity Conference, 2021

2019

Large Clique is Hard on Average for Resolution.

Shuo Pang

Electron. Colloquium Comput. Complex., 2019