Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27) by Stasys Jukna
English | 2012 | ISBN: 3642245072 | 628 pages | PDF | 3,8 MB
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.