Amplifying circuit lower bounds against polynomial time, with applications

AbstractWe give a self-reduction for the Circuit Evaluation problem (CircEval) and prove the following consequences. ◦Amplifying size–depth lower bounds. If CircEval has Boolean circuits of nk size and n1−δ depth for some k and δ, then for every $${\epsilon > 0}$$, there is a δ′ > 0 such that CircEval has circuits of $${n^{1 + \epsilon}}$$ size and $${n^{1- \delta^{\prime}}}$$ depth. Moreover, the resulting circuits require only $${\tilde{O}(n^{\epsilon})}$$ bits of non-uniformity to construct. As a consequence, strong enough depth lower bounds for Circuit Evaluation imply a full separation of P and NC (even with a weak size lower bound).◦Lower bounds for quantified Boolean formulas. Let c, d > 1 and e < 1 satisfy c < (1 − e + d )/d. Either the problem of recognizing valid quantified Boolean formulas (QBF) is not solvable in TIME[nc], or the Circuit Evaluation problem cannot be solved with circuits of nd size and ne depth. This implies unconditional polynomial-time uniform circuit lower bounds for solving QBF. We also prove that QBF does not have nc-time uniform NC circuits, for all c < 2.

[1]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[2]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[3]  Wolfgang J. Paul,et al.  On alternation , 1980, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Samuel R. Buss,et al.  Limits on Alternation-Trading Proofs for Time-Space Lower Bounds , 2012, Computational Complexity Conference.

[5]  Carsten Lund,et al.  Interactive Proof Systems and Alternating Time-Space Complexity , 1991, STACS.

[6]  Avi Wigderson,et al.  In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[7]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[8]  Richard J. Lipton,et al.  Amplifying circuit lower bounds against polynomial time, with applications , 2012, computational complexity.

[9]  Eric Allender,et al.  P-uniform circuit complexity , 1989, JACM.

[10]  Pascal Koiran,et al.  A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[11]  Saharon Shelah,et al.  Nearly Linear Time , 1989, Logic at Botik.

[12]  Ryan Williams,et al.  Non-uniform ACC Circuit Lower Bounds , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[13]  Iannis Tourlakis Time-Space Tradeoffs for SAT on Nonuniform Machines , 2001, J. Comput. Syst. Sci..

[14]  D. Sivakumar,et al.  On Quasilinear-Time Complexity Theory , 1995, Theor. Comput. Sci..

[15]  Wolfgang J. Paul,et al.  On alternation II , 2004, Acta Informatica.

[16]  Valentine Kabanets,et al.  Lower Bounds against Weakly Uniform Circuits , 2012, COCOON.

[17]  Richard J. Lipton,et al.  Non-uniform Depth of Polynomial Time and Space Simulations , 2003, FCT.

[18]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[19]  Eli Ben-Sasson,et al.  Short PCPs verifiable in polylogarithmic time , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[20]  Eric Allender,et al.  Amplifying Lower Bounds by Means of Self-Reducibility , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[21]  Samuel R. Buss,et al.  Limits on Alternation Trading Proofs for Time–Space Lower Bounds , 2012, computational complexity.

[22]  Jeff Kinne On TC0 Lower Bounds for the Permanent , 2012, COCOON.

[23]  Ryan Williams Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas , 2008, Electron. Colloquium Comput. Complex..

[24]  Leslie G. Valiant,et al.  On Time Versus Space , 1977, JACM.

[25]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.

[26]  Claus-Peter Schnorr Satisfiability Is Quasilinear Complete in NQL , 1978, JACM.

[27]  D. Sivakumar,et al.  Quasilinear Time Complexity Theory , 1994, STACS.

[28]  Richard J. Lipton,et al.  Time-space lower bounds for satisfiability , 2005, JACM.

[29]  Eric Allender,et al.  Time-space tradeoffs in the counting hierarchy , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[30]  Dieter van Melkebeek,et al.  A Survey of Lower Bounds for Satisfiability and Related Problems , 2007, Found. Trends Theor. Comput. Sci..

[31]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

[32]  Eric Allender,et al.  The Permanent Requires Large Uniform Threshold Circuits , 1999, Chic. J. Theor. Comput. Sci..

[33]  Lance Fortnow,et al.  Time-Space Tradeoffs for Satisfiability , 2000, J. Comput. Syst. Sci..