You are here

Boolean Function Complexity: Advances and Frontiers

Stasys Jukna
Publisher: 
Springer
Publication Date: 
2012
Number of Pages: 
617
Format: 
Hardcover
Series: 
Algorithms and Combinatorics 27
Price: 
84.95
ISBN: 
9783642245077
Category: 
Monograph
We do not plan to review this book.

Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.

Dummy View - NOT TO BE DELETED