Summary: Circuit Complexity before the Dawn of the New
Department of Computer Science
P.O. Box 1179
Piscataway, NJ 08855-1179
http: www.cs.rutgers.edu allender
Abstract. The 1980's saw rapid and exciting development of techniques
for proving lower bounds in circuit complexity. This pace has slowed re-
cently, and there has even been work indicating that quite di erent 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 signi cant 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 Superpolynomial Size Lower Bounds