Abstract
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.
- Michael Alekhnovich and Alexander Razborov. 2001. Resolution is not automatizable unless W{P} is tractable. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science. 210--219. Google Scholar
Digital Library
- Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, and Michael Saks. 2008. Minimizing disjunctive normal form formulas and AC0 circuits given a truth table. SIAM Journal on Computing 38, 1, 63--84. Google Scholar
Digital Library
- Albert Atserias and Elitza Maneva. 2011. Mean-payoff games and propositional proofs. Information and Computation 209, 4, 664--691. Google Scholar
Digital Library
- Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, and Emmanuel Thom. 2013. A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Cryptology ePrint Archive, Report 2013/400. Available at http://eprint.iacr.org/.Google Scholar
- Paul W. Beame, Russell Impagliazzo, Jan Krajíček, Toniann Pitassi, Pavel Pudlák, and Alan Woods. 1992. Exponential lower bounds for the pigeonhole principle. In Proceedings of the 24th Annual ACM Symposium on Computing. ACM New York, NY, 200--220. Google Scholar
Digital Library
- Maria Luisa Bonet, Samuel R. Buss, and Toniann Pitassi. 1995. Are there hard examples for Frege systems? In Feasible Mathematics II, P. Clote and J. Remmel (Eds.). Birkhäuser, Boston, MA, 30--56.Google Scholar
- Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, and Toniann Pitassi. 2004. Non-automatizability of bounded-depth Frege proofs. Computational Complexity 13, 1--2, 47--68. Google Scholar
Digital Library
- Maria Luisa Bonet, Toniann Pitassi, and Ran Raz. 2000. On interpolation and automatization for Frege systems. SIAM Journal on Computing 29, 6, 1939--1967. Google Scholar
Digital Library
- Richard P. Brent. 1974. The parallel evaluation of general arithmetic expressions. Journal of the ACM 21, 201--206. Google Scholar
Digital Library
- Samuel R. Buss. 1987. Polynomial size proofs of the pigeonhole principle. Journal of Symbolic Logic 57, 916--927.Google Scholar
Cross Ref
- Stephen A. Cook and Robert A. Reckhow. 1979. The relative efficiency of propositional proof systems. Journal of Symbolic Logic 44, 1, 36--50.Google Scholar
- Xudong Fu and Alasdair Urquhart. 1996. Simplified lower bounds for propositional proofs. Notre Dame Journal of Formal Logic 37, 4, 523--544.Google Scholar
Cross Ref
- Kaveh Ghasemloo and Stephen A. Cook. 2013. Theories for subexponential-size bounded-depth Frege proofs. In Proceedings of the Annual Conference on Computer Science Logic (CSL’13). 296--315. DOI:http://dx.doi.org/10.4230/LIPIcs.CSL.2013.296Google Scholar
- Johan Håstad. 1987. Computational Limitations of Small Depth Circuits. Ph.D. Dissertation. Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
Digital Library
- Armin Haken. 1985. The intractability of resolution. Theoretical Computer Science 39, 297--305.Google Scholar
Cross Ref
- Antoine Joux. 2013. A new index calculus algorithm with complexity L(1/4 + o(1)) in very small characteristic. Cryptology ePrint Archive, Report 2013/095. Available at http://eprint.iacr.org/.Google Scholar
- Jan Krajíček. 1994. Lower bounds to the size of constant-depth propositional proofs. Journal of Symbolic Logic 59, 1, 73--86. Google Scholar
Digital Library
- Jan Krajíček. 1995. Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, New York, NY. Google Scholar
Digital Library
- Jan Krajíček. 1997. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. Journal of Symbolic Logic 62, 2, 457--486.Google Scholar
Cross Ref
- Jan Krajíček. 2011. Forcing with Random Variables and Proof Complexity. London Mathematical Society, London, United Kingdom.Google Scholar
- Jan Krajíček, Pavel Pudlák, and Alan Woods. 1995. An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms 7, 1, 15--39. DOI:http://dx.doi.org/10.1002/rsa.3240070103 Google Scholar
Digital Library
- Leonid A. Levin. 1973. Universal sequential search problems. Problems of Information Transmission (translated from Russian) 9, 3, 115--116.Google Scholar
- Sebastian Müller. 2013. Polylogarithmic cuts in models of V0. Logical Methods in Computer Science 9, 1, 16.Google Scholar
Cross Ref
- V. A. Nepomnjaščij. 1970. Rudimentary predicates and Turing calculations. Soviet Mathematics Doklady, 1462--1465.Google Scholar
- Knot Pipatsrisawat and Adnan Darwiche. 2011. On the power of clause-learning SAT solvers as resolution engines. Artificial Intelligence 175, 2, 512--525. Google Scholar
Digital Library
- Toniann Pitassi, Paul Beame, and Russell Impagliazzo. 1993. Exponential lower bounds for the pigeonhole principle. Computational Complexity 3, 2, 97--140. DOI:http://dx.doi.org/10.1007/BF01200117 Google Scholar
Digital Library
- Robert A. Reckhow. 1976. On the Lengths of Proofs in the Propositional Calculus. Ph.D. Dissertation. University of Toronto. Google Scholar
Digital Library
- Michael Sipser. 1983. Borel sets and circuit complexity. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC’83). ACM, New York, NY, 61--69. DOI:http://dx.doi.org/10.1145/800061.808733 Google Scholar
Digital Library
- P. M. Spira. 1971. On time-hardware complexity tradeoffs for Boolean functions. In Proceedings of the 4th Hawaii Symposium on System Sciences. IEEE, Los Alamitos, CA, 525--527.Google Scholar
Index Terms
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds
Recommendations
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11: Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part IWe give a general transformation which turns polynomialsize 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-...
Non-commutative formulas and frege lower bounds: a new characterization of propositional proofs
CCC '15: Proceedings of the 30th Conference on Computational ComplexityDoes every Boolean tautology have a short propositional-calculus proof? Here, a propositional-calculus (i.e. Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulas using a fixed set of sound derivation rules. ...
Parameterized Bounded-Depth Frege Is not Optimal
A general framework for parameterized proof complexity was introduced by Dantchev et al. [2007]. There, the authors show important results on tree-like Parameterized Resolution---a parameterized version of classical Resolution---and their gap complexity ...






Comments