Item description for Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series) by Heribert Vollmer...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 0.75" Width: 6.5" Height: 9.75" Weight: 1.1 lbs.
Release Date Jul 30, 1999
ISBN 3540643109 ISBN13 9783540643104
Availability 70 units. Availability accurate as of Feb 22, 2017 05:37.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
Reviews - What do customers think about Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series)?
A very well written monograph on circuit complexity Jul 18, 2001
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!