02116nmm a2200349 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100001800139245009800157250001700255260006300272300003200335505025300367653004400620653002600664653002100690653002900711653002300740653001600763653001800779653001800797710003400815041001900849989003600868490003300904856007200937082000801009520074901017EB000387965EBX0100000000000000024101700000000000000.0cr|||||||||||||||||||||130626 ||| eng a97836422450841 aJukna, Stasys00aBoolean Function ComplexityhElektronische RessourcebAdvances and Frontierscby Stasys Jukna a1st ed. 2012 aBerlin, HeidelbergbSpringer Berlin Heidelbergc2012, 2012 aXVI, 620 pbonline resource0 aPart 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 aInformation and Communication, Circuits aTheory of Computation aComputer science aMathematics of Computing aInformation theory aMathematics aCombinatorics aCombinatorics2 aSpringerLink (Online service)07aeng2ISO 639-2 bSpringeraSpringer eBooks 2005-0 aAlgorithms and Combinatorics uhttps://doi.org/10.1007/978-3-642-24508-4?nosfx=yxVerlag3Volltext0 a519 aBoolean 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