A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

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

2021
*
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
*

We propose a diagonalization-based approach to several important questions in proof complexity. We illustrate this approach in the context of the algebraic proof system IPS and in the context of propositional proof systems more generally. We give an explicit sequence of CNF formulas {φ n } such that VNP = VP iff there are no polynomial-size IPS proofs for the formulas φ n . This provides the first natural equivalence between proof complexity lower bounds and standard algebraic complexity lower

doi:10.1145/3406325.3451010
fatcat:n7c3szaru5awtkpbe4jqni7jwy