Shuo Pang

---

Brief description

• Graph colouring is hard on average for polynomial calculus and Nullstellensatz (2023)

  Joint with Jonas Conneryd, Susanna de Rezende, Jakob Nordström, and Kilian Risse

  FOCS2023. Talk slides (p22 corrects an expository flaw made in the talk)

• SoS lower bound for exact planted clique (2021)

  CCC2021, submitted to journal

• On CDCL-based proof systems with the ordered decision strategy (2019)

  Joint with Nathan Mull and Alexander Razborov

  SAT2020, SICOMP2022

• Large clique is hard on average for resolution (2019)

  16th CSR2021