Ryan Williams
Skip Abstract Section
Abstract
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove the following.
---NEXP, the class of languages accepted in nondeterministic exponential time, does not have nonuniform ACC circuits of polynomial size. The size lower bound can be slightly strengthened to quasipolynomials and other less natural functions.
---ENP, the class of languages recognized in 2O(n) time with an NP oracle, doesn’t have nonuniform ACC circuits of 2no(1) size. The lower bound gives an exponential size-depth tradeoff: for every d, m there is a δ > 0 such that ENP doesn’t have depth-d ACC circuits of size 2nδ with MODm gates.
Previously, it was not known whether EXPNP had depth-3 polynomial-size circuits made out of only MOD6 gates. The high-level strategy is to design faster algorithms for the circuit satisfiability problem over ACC circuits, then prove that such algorithms entail these lower bounds. The algorithms combine known properties of ACC with fast rectangular matrix multiplication and dynamic programming, while the second step requires a strengthening of the author’s prior work.
- Scott Aaronson and Avi Wigderson. 2009. Algebrization: A new barrier in complexity theory. ACM Trans. Comput. Theory 1, 1. Google Scholar
Digital Library
- Manindra Agrawal, Eric Allender, and Samir Datta. 2000. On TC0, AC0, and arithmetic circuits. J. Comput. Syst. Sci. 60, 2, 395--421. Google ScholarCross Ref
- Miklos Ajtai. 1983. Σ11-formulae on finite structures. Ann. Pure Appl. Logic 24, 1--48.Google ScholarCross Ref
- Eric Allender. 1989. A note on the power of threshold circuits. In Proceedings of FOCS. 580--584. Google ScholarDigital Library
- Eric Allender. 1999. The permanent requires large uniform threshold circuits. Chicago J. Theoret. Comput. Sci.Google Scholar
- Eric Allender and Vivek Gore. 1991. On strong separations from AC0. Fund. Computat. Theory 8.Google Scholar
- Noga Alon and Ravi B. Boppana. 1987. The monotone circuit complexity of Boolean functions. Combinatorica 7, 1, 1--22. Google ScholarDigital Library
- Sanjeev Arora and Boaz Barak. 2009. Computational Complexity - A Modern Approach. Cambridge University Press. Google ScholarDigital Library
- László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. 1993. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computat. Complex. 3, 4, 307--318. Google ScholarDigital Library
- Theodore Baker, John Gill, and Robert Solovay. 1975. Relativizations of the P =? NP question. SIAM J. Comput. 4, 4, 431--442.Google ScholarCross Ref
- David A. Mix Barrington. 1989. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 1, 150--164. Google ScholarDigital Library
- David A. Mix Barrington and Howard Straubing. 1995. Superlinear lower bounds for bounded-width branching programs. J. Comput. Syst. Sci. 50, 3, 374--381. Google ScholarDigital Library
- David A. Mix Barrington and Denis Thérien. 1988. Finite monoids and the fine structure of NC1. J. ACM 35, 4, 941--952. Google ScholarDigital Library
- David A. Mix Barrington, Howard Straubing, and Denis Thérien. 1990. Non-uniform automata over groups. Inf. Comput. 89, 2, 109--132. Google ScholarDigital Library
- Richard Beigel and Jun Tarui. 1994. On ACC. Computat. Complex., 350--366. Google ScholarDigital Library
- Dario Bini and Victor Pan. 1994. Polynomial and Matrix Computations. Birkhauser. Google ScholarDigital Library
- Andreas Björklund, Thore Husfeldt, and Mikko Koivisto. 2009. Set partitioning via inclusion-exclusion. SIAM J. Comput. 39, 2, 546--563. Google ScholarDigital Library
- Harry Buhrman, Lance Fortnow, and Thomas Thierauf. 1998. Nonrelativizing separations. In Proceedings of 13th Annual IEEE Conference on Computational Complexity. 8--12. Google ScholarDigital Library
- Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi. 2006. A duality between clause width and clause density for SAT. In Proceedings of the IEEE Conference on Computational Complexity. 252--260. Google ScholarDigital Library
- Chris Calabro, Russell Impagliazzo, and Ramamohan Paturi. 2009. The complexity of satisfiability of small depth circuits. In Proceedings of the International Workshop on Parameterized and Exact Complexity (IWPEC). 75--85. Google ScholarDigital Library
- John F. Canny, Erich Kaltofen, and Lakshman Yagati. 1989. Solving systems of non-linear equations faster. In Proceedings of the ACM-SIGSAM International Symposium on Symbolic and Algebraic Computation. 121--128. Google ScholarDigital Library
- Hervé Caussinus. 1996. A note on a theorem of Barrington, Straubing and Thérien. Inf. Process. Lett. 58, 1, 31--33. Google ScholarDigital Library
- Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, and Denis Thérien. 2006. Lower bounds for circuits with MODm gates. In Proceedings of FOCS. 709--718. Google ScholarDigital Library
- Arkadev Chattopadhyay and Avi Wigderson. 2009. Linear systems over composite moduli. In Proceedings of FOCS. 43--52. Google ScholarDigital Library
- Stephen A. Cook. 1988. Short propositional formulas represent nondeterministic computations. Inf. Proc. Lett. 26, 5, 269--270. Google ScholarDigital Library
- Don Coppersmith. 1982. Rapid multiplication of rectangular matrices. SIAM J. Comput. 11, 3, 467--471.Google ScholarCross Ref
- Don Coppersmith. 1997. Rectangular matrix multiplication revisited. J. Complex. 13, 42--49. Google ScholarDigital Library
- Evgeny Dantsin and Edward A. Hirsch. 2009. Worst-case upper bounds. In Handbook of Satisfiability, 403--424.Google Scholar
- Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, and Anastasios Viglas. 2005. Time-space lower bounds for satisfiability. J. ACM 52, 6, 835--865. Google ScholarDigital Library
- Merrick L. Furst, James B. Saxe, and Michael Sipser. 1984. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 1, 13--27.Google ScholarCross Ref
- Frederic Green, Johannes Kobler, Kenneth W. Regan, Thomas Schwentick, and Jacobo Torán. 1995. The power of the middle bit of a #P function. J. Comput. System Sci. 50, 3, 456--467. Google ScholarDigital Library
- Vince Grolmusz. 1998. A lower bound for depth-3 circuits with MOD m gates. Inf. Proc. Lett. 67, 2, 87--90. Google ScholarDigital Library
- Vince Grolmusz and Gábor Tardos. 2000. Lower bounds for (MODp-MODm) circuits. SIAM J. Comput. 29, 4, 1209--1222. Google ScholarDigital Library
- Yuri Gurevich and Saharon Shelah. 1989. Nearly linear time. In Proceedings of the Symposium on Logical Foundations of Computer Science, A. R. Meyer and M. A. Taitslin Eds., Lecture Notes in Computer Science, vol. 363, Springer, Berlin, 108--118. Google ScholarDigital Library
- Kristoffer Arnsfelt Hansen. 2006. Constant width planar computation characterizes ACC0. Theory Comput. Syst. 39, 1, 79--92.Google ScholarCross Ref
- Kristoffer Arnsfelt Hansen and Michal Koucký. 2010. A new characterization of ACC0 and probabilistic CC0. Computat. Complex. 19, 2, 211--234. Google ScholarDigital Library
- Johan Håstad. 1986. Almost optimal lower bounds for small depth circuits. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing. 6--20. Google ScholarDigital Library
- John E. Hopcroft and J. Musinski. 1973. Duality applied to the complexity of matrix multiplication and other bilinear forms. SIAM J. Comput. 2, 3, 159--173.Google ScholarDigital Library
- Xiaohan Huang and Victor Y. Pan. 1998. Fast rectangular matrix multiplication and applications. J. Complex. 14, 2, 257--299. Google ScholarDigital Library
- Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson. 2002. In search of an easy witness: Exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65, 4, 672--694. Google ScholarDigital Library
- Russell Impagliazzo, William Matthews, and Ramamohan Paturi. 2012. A satisfiability algorithm for AC0. In Proceedings of SODA. 961--972. Google ScholarDigital Library
- Kazuo Iwama and Hiroki Morizumi. 2002. An explicit lower bound of 5n − o(n) for Boolean circuits. In Proceedings of MFCS. 353--364. Google ScholarDigital Library
- Valentine Kabanets and Russell Impagliazzo. 2004. Derandomizing polynomial identity tests means proving circuit lower bounds. Computat. Complex. 13, 1--2, 1--46. Google ScholarDigital Library
- Ravi Kannan. 1982. Circuit-size lower bounds and non-reducibility to sparse sets. Inf. Control 55, 1, 40--56.Google ScholarCross Ref
- Ravi Kannan, H. Venkateswaran, V. Vinay, and Andrew Chi-Chih Yao. 1993. A circuit-based proof of Toda’s theorem. Inf. Comput. 104, 2, 271--276. Google ScholarDigital Library
- Adam Klivans and Dieter van Melkebeek. 2002. Graph nonisomorphism has subexponential size proofs unless the polynomial hierarchy collapses. SIAM J. Comput. 31, 5, 1501--1526. Google ScholarDigital Library
- Matthias Krause and Pavel Pudlák. 1997. On the computational power of depth-2 circuits with threshold and modulo gates. Theoret. Comput. Sci. 174, 1--2, 137--156. Google ScholarDigital Library
- Oded Lachish and Ran Raz. 2001. Explicit lower bound of 4.5n − o(n) for Boolena circuits. In Proceedings of STOC. 399--408. Google ScholarDigital Library
- Peter Bro Miltersen, N. V. Vinodchandran, and Osamu Watanabe. 1999. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In Proceedings of COCOON. Lecture Notes in Computer Science, vol. 1627, Springer, 210--220. Google ScholarDigital Library
- Noam Nisan and Avi Wigderson. 1994. Hardness vs randomness. J. Comput. Syst. Sci. 49, 2, 149--167. Google ScholarDigital Library
- Victor Y. Pan. 1984. How to Multiply Matrices Faster. Lecture Notes in Computer Science, vol. 179, Springer-Verlag. Google ScholarDigital Library
- Christos H. Papadimitriou and Mihalis Yannakakis. 1986. A note on succinct representations of graphs. Inf. Control 71, 3, 181--185. Google ScholarDigital Library
- Wolfgang J. Paul and Rüdiger Reischuk. 1980. On alternation II. A graph theoretic approach to determinism versus nondeterminism. Acta Informatica 14, 4, 391--403.Google ScholarDigital Library
- Alexander Razborov and Steven Rudich. 1997. Natural proofs. J. Comput. Syst. Sci. 55, 1, 24--35. Google ScholarDigital Library
- Alexander A. Razborov. 1985. Lower bounds for the monotone complexity of some Boolean functions. Sov. Math. Dokl. 31, 354--357.Google Scholar
- Alexander A. Razborov. 1987. Lower bounds on the size of bounded-depth networks over the complete basis with logical addition. Math. Notes Acad. Sci. USSR 41, 4, 333--338.Google ScholarCross Ref
- Alexander A. Razborov. 1989. On the method of approximations. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing. 167--176. Google ScholarDigital Library
- J. M. Robson. 1991. An O(T log T) reduction from RAM computations to satisfiability. Theoret. Comput. Sci. 82, 1, 141--149. Google ScholarDigital Library
- Rahul Santhanam. 2010. Fighting perebor: New and improved algorithms for formula and QBF satisfiability. In Proceedings of FOCS. 183--192. Google ScholarDigital Library
- Rahul Santhanam and Ryan Williams. 2013. On medium-uniformity and circuit lower bounds. In Proceedings of the IEEE Conference on Computational Complexity. 15--23.Google ScholarCross Ref
- Claus-Peter Schnorr. 1978. Satisfiability is quasilinear complete in NQL. J. ACM 25, 1, 136--145. Google ScholarDigital Library
- Arnold Schönhage. 1981. Partial and total matrix multiplication. SIAM J. Comput. 10, 3, 434--455.Google ScholarDigital Library
- Rainer Schuler. 2005. An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algor. 54, 1, 40--44. Google ScholarDigital Library
- Joel Seiferas, Michael Fischer, and Albert Meyer. 1978. Separating nondeterministic time complexity classes. J. ACM 25, 1, 146--167. Google ScholarDigital Library
- Kazuhisa Seto and Suguru Tamaki. 2013. A satisfiability algorithm and average-case hardness for formulas over the full binary basis. Computat. Complex. 22, 2, 245--274.Google ScholarCross Ref
- Roman Smolensky. 1987. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of STOC. 77--82. Google ScholarDigital Library
- Denis Thérien. 1994. Circuits constructed with MODq gates cannot compute AND in sublinear size. Computat. Complex. 4, 383--388. Google ScholarDigital Library
- Seinosuke Toda. 1991. PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 5, 865--877. Google ScholarDigital Library
- Iannis Tourlakis. 2001. Time-space tradeoffs for SAT on nonuniform machines. J. Comput. Syst. Sci. 63, 2, 268--287. Google ScholarDigital Library
- G. S. Tseitin. 1968. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logics, 115--125.Google Scholar
- Leslie Valiant and Vijay Vazirani. 1986. NP is as easy as detecting unique solutions. Theoret. Comp. Sci. 47, 3, 85--93. Google ScholarDigital Library
- Fengming Wang. 2011. NEXP does not have non-uniform quasipolynomial-size ACC circuits of o(loglogn) depth. In Proceedings of TAMC. 164--170. Google ScholarDigital Library
- Ryan Williams. 2011. Guest column: A casual tour around a circuit complexity bound. SIGACT News 42, 3, 54--76. Google ScholarDigital Library
- Ryan Williams. 2013. Improving exhaustive search implies superpolynomial lower bounds. SIAM J. Comput. 42, 3, 1218--1244.Google ScholarCross Ref
- Pei Yuan Yan and Ian Parberry. 1994. Exponential size lower bounds for some depth three circuits. Inf. Comput. 112, 1, 117--130. Google ScholarDigital Library
- Andrew Chi-Chih Yao. 1985. Separating the polynomial-time hierarchy by oracles (preliminary version). In Proceedings of FOCS. 1--10. Google ScholarDigital Library
- Andrew Chi-Chih Yao. 1990. On ACC and threshold circuits. In Proceedings of FOCS. 619--627. Google ScholarDigital Library
- Stanislav Žák. 1983. A Turing machine time hierarchy. Theoret. Comput. Sci. 26, 3, 327--333.Google ScholarCross Ref
Index Terms
- Nonuniform ACC Circuit Lower Bounds
Recommendations
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe prove that if every problem in NP has nk-size circuits for a fixed constant k, then for every NP-verifier and every yes-instance x of length n for that verifier, the verifier’s search space has an nO(k3)-size witness circuit: a witness for x that can ...
Non-uniform ACC Circuit Lower Bounds
CCC '11: Proceedings of the 2011 IEEE 26th Annual Conference on Computational ComplexityThe class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$m$ gates, where $m > 1$ is an arbitrary constant. We prove:- $NTIME[2^n]$ does not have non-uniform ACC circuits of polynomial size. The size ...
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma
We prove that if every problem in ${NP}$ has $n^k$-size circuits for a fixed constant $k$, then for every ${NP}$-verifier and every yes-instance $x$ of length $n$ for that verifier, the verifier's search space has an $n^{O(k^3)}$-size witness circuit: A ...
Comments