Circuit Complexity before the Dawn of the New Millennium

The 1980's saw rapid and exciting development of techniques for proving lower bounds in circuit complexity. This pace has slowed recently, and there has even been work indicating that quite different proof techniques must be employed to advance beyond the current frontier of circuit lower bounds. Although this has engendered pessimism in some quarters, there have in fact been many positive developments in the past few years showing that significant progress is possible on many fronts. This paper is a (necessarily incomplete) survey of the state of circuit complexity as we await the dawn of the new millennium.

[1]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[2]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[3]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[5]  Christopher B. Wilson.  Relativized circuit complexity , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[6]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[7]  Neil Immerman.  Languages which capture complexity classes , 1983, STOC '83.

[8]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[9]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[10]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[11]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[12]  Hans Heller,et al.  On Relativized Exponential and Probabilistic Complexity Classes , 1986, Inf. Control..

[13]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[14]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[15]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[16]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[17]  Denis Thérien,et al.  Finite monoids and the fine structure of NC1 , 1987, STOC.

[18]  Larry J. Stockmeyer,et al.  Classifying the computational complexity of problems , 1987, The Journal of Symbolic Logic.

[19]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[20]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[21]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[22]  Finite monoids and the fine structure of NC1 , 1988, JACM.

[23]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1988, J. Comput. Syst. Sci..

[24]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  Neil Immerman,et al.  Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[26]  Moni Naor,et al.  Efficient cryptographic schemes provably as secure as subset sum , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Georg Schnitger,et al.  Relating Boltzmann machines to conventional models of computation , 1987, Neural Networks.

[28]  James C. Corbett,et al.  On the Relative Complexity of Some Languages in NC , 1989, Inf. Process. Lett..

[29]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[30]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[31]  Howard Straubing,et al.  Non-Uniform Automata Over Groups , 1990, Inf. Comput..

[32]  Ravi B. Boppana,et al.  The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[33]  James Aspnes,et al.  The expressive power of voting polynomials , 1991, STOC '91.

[34]  Matthias Krause,et al.  Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[35]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[36]  Howard Straubing,et al.  Superlinear lower bounds for bounded-width branching programs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[37]  Eric Allender,et al.  Rudimentary Reductions Revisited , 1991, Inf. Process. Lett..

[38]  James C. Corbett,et al.  A Note on Some Languages in Uniform ACC0 , 1991, Theor. Comput. Sci..

[39]  Matthias Krause,et al.  Geometric arguments yield better bounds for threshold circuits and distributed computing , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[40]  Noam Nisan,et al.  BPP has subexponential time simulations unless EXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[41]  Alexander A. Razborov,et al.  On Small Depth Threshold Circuits , 1992, SWAT.

[42]  David A. Mix Barrington.  Quasipolynomial size circuit classes , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[43]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[44]  Howard Straubing,et al.  Complex Polynomials and Circuit Lower Bounds for Modular Counting , 1992, LATIN.

[45]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[46]  Harry Buhrman,et al.  Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy , 1992, FSTTCS.

[47]  Richard Beigel,et al.  On Probabilistic ACC Circuits with an Exact-Threshold Output Gate , 1992, ISAAC.

[48]  David A. Mix Barrington,et al.  Representing Boolean functions as polynomials modulo composite numbers , 1992, STOC '92.

[49]  Jack H. Lutz.  Almost Everywhere High Nonuniform Complexity , 1992, J. Comput. Syst. Sci..

[50]  Marek Karpinski,et al.  Simulating threshold circuits by majority circuits , 1993, SIAM J. Comput..

[51]  Zhi-Li Zhang,et al.  Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate , 1993, STACS.

[52]  Alexander A. Razborov,et al.  n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom , 1993, Information Processing Letters.

[53]  Andrew Chi-Chih Yao,et al.  A Circuit-Based Proof of Toda's Theorem , 1993, Inf. Comput..

[54]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[55]  Avi Wigdersony.  N (log N) Lower Bounds on the Size of Depth 3 Threshold Circuits with and Gates at the Bottom , 1993 .

[56]  R. Smolensky.  On representations by low-degree polynomials , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[57]  Avi Wigderson,et al.  On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity , 1993, Theor. Comput. Sci..

[58]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[59]  Jun Tarui.  Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy , 1993, Theor. Comput. Sci..

[60]  Pavel Pudlák,et al.  Top-down lower bounds for depth 3 circuits , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[61]  Denis Thérien,et al.  Threshold Circuits for Iterated Multiplication: Using AC0 for Free , 1993, STACS.

[62]  Meera Sitharam,et al.  Pseudorandom generators and learning algorithms for AC , 1994, STOC '94.

[63]  Vince Grolmusz,et al.  A weight-size trade-off for circuits with MOD m gates , 1994, STOC '94.

[64]  James Aspnes,et al.  The expressive power of voting polynomials , 1994, Comb..

[65]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[66]  Denis Thi Rien.  CIRCUITS CONSTRUCTED WITH MODq GATES CANNOT COMPUTE "AND" IN SUBLINEAR SIZE , 1994 .

[67]  Jack H. Lutz,et al.  Cook Versus Karp-Levin: Separating Completeness Notions if NP Is not Small (Extended Abstract) , 1994, STACS.

[68]  Eric Allender,et al.  Measure on small complexity classes, with applications for BPP , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[69]  K. Siu,et al.  Theoretical Advances in Neural Computation and Learning , 1994, Springer US.

[70]  I. Parberry,et al.  Exponential Size Lower Bounds for Some Depth Three Circuits , 1994, Inf. Comput..

[71]  J. Radhakrishnan.  ∑II∑ threshold formulas , 1994 .

[72]  Eric Allender,et al.  Depth Reduction for Circuits of Unbounded Fan-In , 1994, Inf. Comput..

[73]  Noam Nisan,et al.  Hardness vs Randomness , 1994, J. Comput. Syst. Sci..

[74]  Pavel Pudlák,et al.  On the computational power of depth 2 circuits with threshold and modulo gates , 1994, STOC '94.

[75]  Eric Allender,et al.  A Uniform Circuit Lower Bound for the Permanent , 1994, SIAM J. Comput..

[76]  Stasys Jukna,et al.  Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates , 1995, Inf. Process. Lett..

[77]  Mikael Goldmann.  A Note on the Power of Majority Gates and Modular Gates , 1995, Inf. Process. Lett..

[78]  Lance Fortnow,et al.  Circuit Lower Bounds à la Kolmogorov , 1995, Inf. Comput..

[79]  Jin-Yi Cai,et al.  Pseudorandom generators, measure theory, and natural proofs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[80]  Gábor Tardos,et al.  A lower bound on the mod 6 degree of the OR function , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[81]  Howard Straubing,et al.  Superlinear Lower Bounds for Bounded-Width Branching Programs , 1995, J. Comput. Syst. Sci..

[82]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[83]  Vince Grolmusz.  Separating the Communication Complexities of MOD m and MOD p Circuits , 1995, J. Comput. Syst. Sci..

[84]  Pavel Pudlák,et al.  On computing Boolean functions by sparse real polynomials , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[85]  C. Papadimitriou.  Vector Analysis of Threshold Functions , 1995 .

[86]  Thomas Schwentick,et al.  The Power of the Middle Bit of a #P Function , 1995, J. Comput. Syst. Sci..

[87]  Frederic Green.  Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates , 1995, STACS.

[88]  Matthias Krause,et al.  Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In , 1995, Math. Syst. Theory.

[89]  Neil Immerman,et al.  The Complexity of Iterated Multiplication , 1995, Inf. Comput..

[90]  Vince Grolmusz.  On the Weak mod m Representation of Boolean Functions , 1995, Chic. J. Theor. Comput. Sci..

[91]  A. Razborov.  Bounded Arithmetic and Lower Bounds in Boolean Complexity , 1995 .

[92]  Thomas Hofmeister,et al.  A Note on the Simulation of Exponential Threshold Weights , 1996, COCOON.

[93]  D. Thérien,et al.  Finite groupoids and their applications to computational complexity , 1996 .

[94]  Hervé Caussinus.  A Note on a Theorem of Barrington, Straubing and Thérien , 1996, Inf. Process. Lett..

[95]  Meera Sitharam,et al.  Stable basis families and complexity lower bounds , 1996, Electron. Colloquium Comput. Complex..

[96]  Eric Allender,et al.  An isomorphism theorem for circuit complexity , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[97]  Shi-Chun Tsai,et al.  Lower Bounds on Representing Boolean Functions as Polynomials in Zm , 1996, SIAM J. Discret. Math..

[98]  D. Sivakumar,et al.  PROBABILISTIC TECHNIQUES IN STRUCTURAL COMPLEXITY THEORY , 1996 .

[99]  Matthias Krause.  More on Computing Boolean Functions by Sparse Real Polynomials and Related Types of Threshold Circuits , 1996 .

[100]  Kazuo Iwama,et al.  Parallel complexity hierarchies based on PRAMs and DLOGTLME-uniform circuits , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[101]  Eric Allender.  A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract) , 1996, COCOON.

[102]  Jaikumar Radhakrishnan,et al.  Deterministic restrictions in circuit complexity , 1996, STOC '96.

[103]  Heribert Vollmer,et al.  Nondeterministic NC 1 Computation. , 1996 .

[104]  Jack H. Lutz,et al.  Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small , 1996, Theor. Comput. Sci..

[105]  Jin-Yi Cai,et al.  Constant depth circuits and the Lutz hypothesis , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[106]  Kousha Etessami.  Counting Quantifiers, Successor Relations, and Logarithmic Space , 1997, J. Comput. Syst. Sci..

[107]  J. Köbler,et al.  New Collapse Consequences of NP Having Small Circuits , 1999, SIAM J. Comput..

[108]  Heribert Vollmer,et al.  Nondeterministic NC1 Computation , 1998, J. Comput. Syst. Sci..

[109]  Denis Thérien,et al.  Threshold Circuits of Small Majority-Depth , 1998, Inf. Comput..

[110]  Eric Allender,et al.  Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem , 1998, J. Comput. Syst. Sci..

[111]  Frederic Green.  Complex Fourier Technique for Lower Bounds on the Mod-m Degree Revised and Expanded Version of \lower Bounds for Depth-three Circuits with Equals and Mod-gates," in 12th Annual Symposium on Theoretical , .