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” that hav...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Edition: | 1st ed. 2012. |
| Series: | Algorithms and Combinatorics,
27 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-642-24508-4 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|