Boolean circuit complexity

  • Mike Paterson
Session 4: Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)


The talk will survey some old, and some recent, results relating to Boolean circuits, and will concentrate particularly on the lower levels of complexity.

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Mike Paterson
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickUSA

Personalised recommendations