@inproceedings{c9f6ec036cad45eeaaffb6eed90e139c,
title = "Circuit complexity before the dawn of the new millennium",
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.",
author = "Eric Allender",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 16th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 1996 ; Conference date: 18-12-1996 Through 20-12-1996",
year = "1996",
doi = "10.1007/3-540-62034-6_33",
language = "English (US)",
isbn = "3540620346",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--18",
editor = "Vijay Chandru and V. Vinay",
booktitle = "Foundations of Software Technology and Theoretical Computer Science - 16th Conference 1996, Proceedings",
address = "Germany",
}