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.
Cite
CITATION STYLE
Allender, E. (1996). Circuit complexity before the dawn of the new millennium. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1180, pp. 1–18). Springer Verlag. https://doi.org/10.1007/3-540-62034-6_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.