Custom cover image
Boolean Function Complexity : Advances and Frontiers / by Stasys Jukna
Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Algorithms and Combinatorics ; 27 | SpringerLink BücherPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: Online-Ressource (XV, 617p. 70 illus, digital)ISBN:- 9783642245084
- Q350-390 QA10.4
- Q350-390
- QA10.4
Contents:
Summary: 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.Summary: 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.PPN: PPN: 1651281319Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SXMS | ZDB-2-SMA
No physical items for this record