Shuo Pang
Lecturer at University of Bristol
Research: computational complexity and discrete math
Research
• Truly supercritical trade-offs for resolution, cutting planes, monotone
circuits, and Weisfeiler-Leman
Joint with Susanna DeRezende, Noah Fleming, Duri Janett, and Jakob Nordsöm
STOC 2025
• Sum-of-Squares lower bound for non-Gaussian component analysis
Joint with Ilias Diakonikolas, Sushrut Karmalkar, and Aaron Potechin
FOCS 2024
• Graph colouring is hard on average for polynomial calculus and Nullstellensatz
Joint with Jonas Conneryd, Susanna DeRezende, Jakob Nordström, and Kilian Risse
FOCS 2023
• SoS lower bound for exact planted clique
CCC 2021
• On CDCL-based proof systems with the ordered decision strategy 2019
Joint with Nathan Mull and Alexander Razborov
SAT 2020, SICOMP 2022
• Large clique is hard on average for resolution 2019
CSR 2021