TY - JOUR
T1 - Exponential lower bounds for AC0-Frege imply superpolynomial Frege lower bounds
AU - Filmus, Yuval
AU - Pitassi, Toniann
AU - Santhanam, Rahul
N1 - Publisher Copyright:
© 2015 ACM 1942-3454/2015/05-ART5 15.00.
PY - 2015/5/1
Y1 - 2015/5/1
N2 - We give a general transformation that turns polynomial-size Frege proofs into subexponential-size AC0-Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, as it is a long-standing open problem to prove superpolynomial lower bounds for Frege. Our construction is optimal for proofs of formulas of unbounded depth. As a consequence of our main result, we are able to shed some light on the question of automatizability for bounded-depth Frege systems. First, we present a simpler proof of the results of Bonet et al. showing that under cryptographic assumptions, bounded-depth Frege proofs are not automatizable. Second, we show that because our proof is more general, under the right cryptographic assumptions, it could resolve the automatizability question for lower-depth Frege systems.
AB - We give a general transformation that turns polynomial-size Frege proofs into subexponential-size AC0-Frege proofs. This indicates that proving truly exponential lower bounds for AC0-Frege is hard, as it is a long-standing open problem to prove superpolynomial lower bounds for Frege. Our construction is optimal for proofs of formulas of unbounded depth. As a consequence of our main result, we are able to shed some light on the question of automatizability for bounded-depth Frege systems. First, we present a simpler proof of the results of Bonet et al. showing that under cryptographic assumptions, bounded-depth Frege proofs are not automatizable. Second, we show that because our proof is more general, under the right cryptographic assumptions, it could resolve the automatizability question for lower-depth Frege systems.
KW - Proof complexity
UR - http://www.scopus.com/inward/record.url?scp=84930165488&partnerID=8YFLogxK
U2 - 10.1145/2656209
DO - 10.1145/2656209
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84930165488
SN - 1942-3454
VL - 7
JO - ACM Transactions on Computation Theory
JF - ACM Transactions on Computation Theory
IS - 2
M1 - 5
ER -