Boolean function complexity advances and frontiers /
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this 'complexity Waterloo'...
| Main Author: | Jukna, Stasys, 1953- |
|---|---|
| Other Authors: | SpringerLink (Online Service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2012.
|
| Physical Description: |
1 online resource (xv, 617 pages) |
| Series: |
Algorithms and combinatorics ;
v. 27. |
| Subjects: |
CMU Electronic Access
Electronic Resource Click Here| Location | Call Number: | Status |
|---|---|---|
| CMU Electronic Access | Available |