---

＜E-Book＞
Boolean Function Complexity : Advances and Frontiers / by Stasys Jukna
(Algorithms and Combinatorics. ISSN:21976783 ; 27)

Edition	1st ed. 2012.
Publisher	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
Year	2012
Language	English
Size	XVI, 620 p : online resource
Authors	*Jukna, Stasys author SpringerLink (Online service)
Subjects	LCSH:Computer science -- Mathematics  All Subject Search LCSH:Computer science LCSH:Discrete mathematics FREE:Mathematical Applications in Computer Science FREE:Theory of Computation FREE:Discrete Mathematics FREE:Mathematics of Computing
Notes	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 HTTP:URL=https://doi.org/10.1007/978-3-642-24508-4

 Similar Items