Cargando…
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"...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Edición: | 1st ed. 2012. |
| Colección: | Algorithms and Combinatorics,
27 |
| Temas: | |
| Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- 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.