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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Yhteisötekijä: | |
| Aineistotyyppi: | Elektroninen E-kirja |
| Kieli: | English |
| Julkaistu: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Painos: | 1st ed. 2012. |
| Sarja: | Algorithms and Combinatorics,
27 |
| Aiheet: | |
| Linkit: | https://doi.org/10.1007/978-3-642-24508-4 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|