Research output per year
Research output per year
Personal profile
Research interests
I study impossibility results ("lower bounds") that show fundamental computational problems require exponential running time for popular types of algorithms. This motif is mathematically distilled and explored in the field of proof complexity, using techniques from combinatorics, logic, and circuit and communication complexity, with results often applicable to areas such as combinatorial optimization and learning theory.
Fingerprint
Dive into the research topics where Shuo Pang is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman
de Rezende, S. F., Fleming, N., Janett, D. A., Nordström, J. & Pang, S., 15 Jun 2025, STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 1371-1382 12 p. (Proceedings of the annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
Open Access1 Citation (Scopus) -
Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis
Diakonikolas, I., Karmalkar, S., Pang, S. & Potechin, A., 29 Nov 2024, 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). Institute of Electrical and Electronics Engineers (IEEE), p. 949-958 10 p. (Annual IEEE Symposium on Foundations of Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
3 Citations (Scopus) -
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
Conneryd, J., de Rezende, S. F., Nordström, J., Pang, S. & Risse, K., 22 Dec 2023, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). Institute of Electrical and Electronics Engineers (IEEE), 11 p. (Annual IEEE Symposium on Foundations of Computer Science).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
2 Citations (Scopus)