Scholar
Shuo Pang
Google Scholar ID: kCQFJi8AAAAJ
Lecturer, University of Bristol
Citations & Impact
Citations
54
H-index
5
i10-index
2
Publications
8
Co-authors
1
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Truly supercritical trade-offs for resolution, cutting planes, monotone circuits, and Weisfeiler-Leman (Joint with Susanna De Rezende, Noah Fleming, Duri Janett, Jakob Nordström)
- Sum-of-Squares lower bound for non-Gaussian component analysis (Joint with Ilias Diakonikolas, Sushrut Karmalkar, Aaron Potechin)
- Graph colouring is hard on average for polynomial calculus and Nullstellensatz (Joint with Jonas Conneryd, Susanna De Rezende, Jakob Nordström, Kilian Risse)
- SoS lower bound for exact planted clique
- On CDCL-based proof systems with the ordered decision strategy (Joint with Nathan Mull, Alexander Razborov)
- Large clique is hard on average for resolution
Research Experience
- Research interests include the length of proofs for graph coloring problems, the existence of short proofs within certain formal deductive systems, etc.
Background
- Lecturer in computer science at the University of Bristol, working in computational complexity and discrete math, with a focus on lower bounds in proof complexity.
