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.

V.1. A-B v.2. C v.3. D-Feynman Measure. v.4. Fibonaccimethod H v.5. Lituus v.6. Lobachevskii Criterion (for Convergence)-Optical Sigman-Algebra. v.7. Orbi t-Rayleigh Equation. v.8. Reaction-Diffusion Equation-Stirling Interpolation Fo rmula. v.9. Stochastic Approximation-Zygmund Class of Functions. v.10. Subject Index-Author Index.