Boolean Function Complexity [electronic resource] : Advances and Frontiers / by Stasys Jukna.
By: Jukna, Stasys [author.].
Contributor(s): SpringerLink (Online service).
Material type:
BookSeries: Algorithms and Combinatorics: 27Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: XV, 617p. 70 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642245084.Subject(s): Mathematics | Information theory | Computer science | Combinatorics | Mathematics | Information and Communication, Circuits | Theory of Computation | Combinatorics | Mathematics of ComputingDDC classification: 519 Online resources: Click here to access online 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.
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.
There are no comments for this item.