Circuit complexity before the dawn of the new millennium

  • Eric Allender
Invited Papers

DOI: 10.1007/3-540-62034-6_33

Volume 1180 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Allender E. (1996) Circuit complexity before the dawn of the new millennium. In: Chandru V., Vinay V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1996. Lecture Notes in Computer Science, vol 1180. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Eric Allender
    • 1
  1. 1.Department of Computer ScienceRutgers UniversityPiscatawayUSA