Communication complexity : a new approach to circuit depth /

Communication Complexity describes a new intuitive model for studying circuit networks that captures the essence of circuit depth. Although the complexity of boolean functions has been studied for almost 4 decades, the main problems the inability to show a separation of any two classes, or to obtain...

Full description

Bibliographic Details

Main Author:	Karchmer, Mauricio
Format:	eBook
Language:	English
Published:	Cambridge, Mass. : MIT Press, ©1989.
Series:	ACM doctoral dissertation awards ; 1988
Subjects:	Algebra, Boolean. Logic circuits. Computational complexity. Automatic theorem proving. COMPUTER SCIENCE/General Electronic books.
Online Access:	Connect to the full text of this electronic book