Iterated lower bound formulas: a diagonalization-based approach to proof complexity

Rahul Santhanam, Iddo Tzameret. Iterated lower bound formulas: a diagonalization-based approach to proof complexity. In Samir Khuller, Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. pages 234-247, ACM, 2021. [doi]

Abstract

Abstract is missing.