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...
Wedi'i Gadw mewn:
| Prif Awdur: | |
|---|---|
| Awdur Corfforaethol: | |
| Fformat: | Electronig eLyfr |
| Iaith: | English |
| Cyhoeddwyd: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Rhifyn: | 1st ed. 2012. |
| Cyfres: | Algorithms and Combinatorics,
27 |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.1007/978-3-642-24508-4 |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Tabl Cynhwysion:
- Part I Basics
- Part II Communication Complexity
- Part III Circuit Complexity
- Part IV Bounded Depth Circuits
- Part V Branching Programs
- Part VI Fragments of Proof Complexity
- A Epilog
- B Mathematical Background
- References
- Index.