Chargement en cours…
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"...
| Cote: | Libro Electrónico |
|---|---|
| Auteur principal: | |
| Collectivité auteur: | |
| Format: | Électronique eBook |
| Langue: | Inglés |
| Publié: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Édition: | 1st ed. 2012. |
| Collection: | Algorithms and Combinatorics,
27 |
| Sujets: | |
| Accès en ligne: | Texto Completo |