Abstract

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.

Citations

262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
253	Constant Depth Circuits, Fourier Transform, and Learnability - Linial, Mansour, et al. - 1993
250	Hardness vs. Randomness - Nisan, Wigderson - 1988
199	Parity, circuits, and the polynomial-time hierarchy - Furst, Saxe, et al. - 1981
184	Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1 - Barrington - 1989
168	The complexity of finite functions - Boppana, Sipser - 1992
167	Separating the Polynomial-Time Hierarchy by Oracles - Yao - 1985
163	Computational Limitations for Small Depth Circuits - H˚astad - 1987
163	PP is as hard as the polynomial-time hierarchy - Toda - 1991
158	Almost everywhere high nonuniform complexity - Lutz - 1992
152	Natural proofs - Razborov, Rudich - 1997
126	On uniformity within NC - Barrington, Immerman, et al. - 1990
126	On the degree of Boolean functions as real polynomials - Nisan, Szegedy - 1994
118	Threshold circuits of bounded depth - Hajnal, Maass, et al. - 1993
104	On uniformity within NC 1 - Barrington, Immerman, et al. - 1990
100	Constant depth reducibility - Chandra, Stockmeyer, et al. - 1984
97	BPP has subexponential time simulations unless EXPTIME has publishable proofs - Babai, Fortnow, et al. - 1993
90	The complexity of decision problems in automata theory and logic - Stockmeyer - 1974
88	Sigma 1 formulae on finite structures - Ajtai
88	On the power of small-depth threshold circuits Computational Complexity - Hastad, Goldmann - 1991
85	The expressive power of voting polynomials - Aspnes, Beigel, et al. - 1994
84	On ACC and threshold circuits - Yao - 1990
80	Majority gates vs. general weighted threshold gates - Goldmann, H˚astad, et al. - 1992
73	Space-bounded reducibility among combinatorial problems - Jones - 1975
69	Efficient cryptographic schemes provably as secure as subset sum - Impagliazzo, Naor - 1996
62	Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets - Kannan - 1982
57	The polynomial method in circuit complexity - Beigel - 1993
57	Expressibility and Parallel Complexity - Immerman - 1989
57	Relativized circuit complexity - Wilson - 1985
56	New collapse consequences of NP having small circuits - Kobler, Watanabe - 1999
53	Representing boolean functions as polynomials modulo composite numbers, Computational Complexity 4 - Barrington, Beigel, et al. - 1994
52	Cook versus Karp-Levin: separating completeness notions if NP is not small. Theoretical Computer Science 164:141--163 - Lutz, Mayordomo - 1996
49	Languages which Capture Complexity Classes - Immerman - 1983
49	On the computational power of depth-2 circuits with threshold and modulo gates, Theor - Krause, Pudlák - 1997
46	A switching lemma primer - Beame - 1994
45	Measure on small complexity classes, with applications for BPP - Allender, Strauss - 1994
43	Non-uniform automata over groups - BARRINGTON, STRAUBING, et al. - 1990
43	Counting quantifiers, successor relations, and logarithmic space - Etessami - 1997
43	Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan--in - Waack - 1991
40	Finite monoids and the fine structure of NC - Barrington, Th'erien - 1988
40	The Complexity of Iterated Multiplication - Immerman, Landau - 1995
37	Classifying the computational complexity of problems - Stockmeyer - 1987
34	Simulating threshold circuits by majority circuits - Goldmann, Karpinski - 1998
34	Parallel computation with threshold functions - Parberry, Schnitger - 1988
29	On relativized exponential and probabilistic complexity classes - Heller - 1986
28	Reductions in circuit complexity: An isomorphism theorem and a gap theorem - Agrawal, Allender - 1998
28	Pseudorandom generators, measure theory, and natural proofs - Regan, Sivakumar, et al. - 1995
24	The permanent requires large uniform threshold circuits - Allender - 1999
23	A uniform circuit lower bound for the permanent - Allender, Gore - 1994
23	When do extra majority gates help? polylog(N) majority gates are equivalent to one - Beigel - 1994