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...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporativní autor: | |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | English |
| Vydáno: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Vydání: | 1st ed. 2012. |
| Edice: | Algorithms and Combinatorics,
27 |
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-642-24508-4 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|