ENGLISH

Boolean Function Complexity: Advances and Frontiers

By Stasys Jukna (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2012
ISBN
3642245072, 9783642245077
DOI
10.1007/978-3-642-24508-4
Language
english
Format
PDF
Filesize
4 MB (3946281 bytes)
Series
Algorithms and Combinatorics 27
Edition
1
Pages
620\634
Time added
2012-03-10 16:00:00
Circuits; Theory of Computation; Combinatorics; MaInformation and Communication

Description

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.

Similar books