[.ca] Introduction to Circuit Complexity: A Uniform Approach (ISBN 3540643109)

A very well written monograph on circuit complexity:
This book is mandatory reading for anyone interested in the fascinating and complex world of complexity theory. Circuits represent an interesting approach to complexity since they allow the computer scientist to gain a better mathematical foothold when attempting to investigate the intrinsic complexity of a problem. The book seems concise, well-written, very accessible to advanced students, and covers most of the important circuit complexity results of the last 20 years. A good supplement to this book, however, is Ingo Wegener's famous "blue book" (which is now downloadable from his website) which provides a more historical and classical treatment of the subject. If P not = NP is proved within my lifetime, I'm estimating that the proof will involve an analysis of circuits. Good luck!