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 zcomplexity Waterlooy that ha...
| Autor principal: | |
|---|---|
| Autor Corporativo: | |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
2012.
|
| Colección: | Algorithms and Combinatorics ;
27. Springer eBooks. |
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b32926819*spi |
| Sumario: | 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 zcomplexity Waterlooy that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics. |
|---|---|
| Descripción Física: | XVI, 620 p. |
| Formato: | Forma de acceso: World Wide Web. |
| ISBN: | 9783642245084 |
