TY  - GEN
TY  - GEN
T1  - Boolean Function Complexity Advances and Frontiers
T2  - Algorithms and Combinatorics,
A1  - Jukna, Stasys.
LA  - English
PP  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg : Imprint: Springer
YR  - 2012
ED  - 1st ed. 2012.
UL  - http://discoverylib.upm.edu.my/discovery/Record/978-3-642-24508-4
AB  - 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.
OP  - 620
CN  - Q350-390
SN  - 9783642245084
KW  - Information theory.
KW  - Computers.
KW  - Combinatorics.
KW  - Computer science—Mathematics.
KW  - Information and Communication, Circuits.
KW  - Theory of Computation.
KW  - Mathematics of Computing.
ER  -