Dr Shuo Pang
BSc, MSc, PhD
Expertise
I research computational complexity and discrete math, with a focus on proof complexity.
Current positions
Lecturer in Algorithms and Complexity
School of Computer Science
Contact
Press and media
Many of our academics speak to the media as experts in their field of research. If you are a journalist, please contact the University’s Media and PR Team:
Research interests
I am interested in mathematical limits of efficient reasoning. Specifically, lower and upper bounds on formal proof systems. With implications for combinatorial optimisation, automated reasoning and machine learning.
Publications
Recent publications
07/01/2026Lower Bounds for CSP Hierarchies Through Ideal Reduction: Annual ACM-SIAM Symposium on Discrete Algorithms - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman - Proceedings of the annual ACM Symposium on Theory of Computing
STOC '25: Proceedings of the 57th Annual ACM Symposium on Theory of Computing
Sum-of-Squares Lower Bounds for Non-Gaussian Component Analysis: 65th IEEE Symposium on Foundations of Computer Science - Annual IEEE Symposium on Foundations of Computer Science
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz: 64th IEEE Symposium on Foundations of Computer Science - Annual IEEE Symposium on Foundations of Computer Science
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
On CDCL-Based Proof Systems with the Ordered Decision Strategy: 23rd International Conference on Theory and Applications of Satisfiability Testing
SIAM Journal on Computing