Boolean Function Complexity : Advances and Frontiers Hardback
by Stasys Jukna
Part of the Algorithms and Combinatorics series
Hardback
- Information
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.
Information
-
Out of Stock - We are unable to provide an estimated availability date for this product
- Format:Hardback
- Pages:620 pages, XVI, 620 p.
- Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publication Date:06/01/2012
- Category:
- ISBN:9783642245077
Other Formats
- PDF from £59.49
- Paperback / softback from £50.26
Information
-
Out of Stock - We are unable to provide an estimated availability date for this product
- Format:Hardback
- Pages:620 pages, XVI, 620 p.
- Publisher:Springer-Verlag Berlin and Heidelberg GmbH & Co. K
- Publication Date:06/01/2012
- Category:
- ISBN:9783642245077