Introduction to Circuit Complexity
Heribert Vollmer · 1999
Where to buy
Check today’s price on Amazon. We do not show prices because they change daily.
View on AmazonAffiliate link. As an Amazon Associate we earn from qualifying purchases.
About the book
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.
Book details
- Year
- 1999
- Language
- English
- Series
- Texts in Theoretical Computer Science An EATCS Series
- Publisher
- Springer Berlin Heidelberg
- Editions
- 1
- Pages
- 272
- ISBN
- 9783642083983
Data source: Wikidata
