Introduction to Circuit Complexity
A Uniform Approach
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.
Check nearby libraries
Buy this book
Previews available in: English
Showing 1 featured edition. View all 1 editions?
| Edition | Availability |
|---|---|
1
Introduction to Circuit Complexity: A Uniform Approach
1999, Springer Berlin Heidelberg
electronic resource :
in English
3642083986 9783642083983
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Online full text is restricted to subscribers.
Also available in print.
Mode of access: World Wide Web.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?
History
- Created July 1, 2019
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| December 25, 2021 | Edited by ImportBot | import existing book |
| December 25, 2021 | Edited by ImportBot | import existing book |
| July 1, 2019 | Created by MARC Bot | Imported from Internet Archive item record |