A reduction of proof complexity to computational complexity for $A{C}^0[p]$ Frege systems

Abstract

We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime $p$ (the so called $A{C}^0[p]$ Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over the finite filed with $p$ elements.

the final version accepted to the Proc.AMS

Cited by in corpus (2)

• The complexity of propositional proofs
• Extended Nullstellensatz proof systems