Shuo Pang: Homepage
Lecturer at Bristol CS
Research interest: computational complexity, discrete math
s.(last name)@bristol.ac.uk
HIDDEN
Publications
• Truly supercritical trade-offs for resolution, cutting planes, monotone circuits, and Weisfeiler-Leman
Joint with Susanna De Rezende, Noah Fleming, Duri Janett, and Jakob Nordsöm• Sum-of-Squares lower bound for non-Gaussian component analysis
Joint with Ilias Diakonikolas, Sushrut Karmalkar, and Aaron Potechin• Graph colouring is hard on average for polynomial calculus and Nullstellensatz
Joint with Jonas Conneryd, Susanna De Rezende, Jakob Nordström, and Kilian Risse• SoS lower bound for exact planted clique• On CDCL-based proof systems with the ordered decision strategy
Joint with Nathan Mull and Alexander Razborov• Large clique is hard on average for resolution