Boolean circuit complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)
Session 4: Invited Papers
The talk will survey some old, and some recent, results relating to Boolean circuits, and will concentrate particularly on the lower levels of complexity.
© Springer-Verlag Berlin Heidelberg 1992