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 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.
| ISBN: | 9783642245077 |
| Publication date: | 6th January 2012 |
| Author: | Stasys Jukna |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Hardback |
| Pagination: | 620 pages |
| Series: | Algorithms and Combinatorics |
| Genres: |
Mathematical theory of computation Maths for computer scientists Discrete mathematics |
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 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.
Boolean Function Complexity features in the following genres: Mathematical theory of computation, Maths for computer scientists, Discrete mathematics
Boolean Function Complexity is available in Hardback
Boolean Function Complexity was written by Stasys Jukna and published by Springer an imprint of Springer Berlin Heidelberg
Boolean Function Complexity has 620 pages
Yes it is part of Algorithms and Combinatorics series
£89.99