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...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Collectivité auteur: | |
| Format: | Électronique eBook |
| Langue: | English |
| Publié: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Édition: | 1st ed. 2012. |
| Collection: | Algorithms and Combinatorics,
27 |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.1007/978-3-642-24508-4 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|