 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) by Heribert Vollmer ISBN-10: 9783540643104 ISBN-10: 3-540-64310-9 ISBN-13: 9783540643104 ISBN-13: 978-3-540-64310-4 Hardcover 1999-07-30 Springer Find Lowest Price |
Editorials | ||
Product Description This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study. It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory. | ||
Reviews | ||
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! | ||