Abstract / Description of output
We give a general transformation which turns polynomial-size Frege proofs to subexponential-size AC0-Frege proofs. This indicates that proving exponential lower bounds for AC0-Frege is hard, since it is a longstanding open problem to prove super-polynomial lower bounds for Frege. Our construction is optimal for tree-like proofs.
As a consequence of our main result, we are able to shed some light on the question of weak 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 weakly automatizable. Secondly, we show that because our proof is more general, under the right cryptographic assumptions, it could resolve the weak automatizability question for lower depth Frege systems.
|Title of host publication||Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings, Part I|
|Editors||Luca Aceto, Monika Henzinger, Jiri Sgall|
|Place of Publication||Zurich, Switzerland|
|Number of pages||12|
|Publication status||Published - 1 Jul 2011|
|Name||Lecture Notes in Computer Science|