Non-commutative circuits and the sum-of-squares problem
Proceedings of the forty-second ACM symposium on Theory of computing
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
Exponential lower bounds and separation for query rewriting
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
The quantum query complexity of read-many formulas
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Average-case lower bounds for formula size
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A rank lower bound for cutting planes proofs of ramsey's theorem
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Ontology-based data access with databases: a short course
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Cancellation-Free circuits in unbounded and bounded depth
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Hi-index | 0.00 |
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.