A Uniform Approach
Hardback
Publication Date: 23/06/1999
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.
- ISBN:
- 9783540643104
- 9783540643104
- Category:
- Mathematical theory of computation
- Format:
- Hardback
- Publication Date:
- 23-06-1999
- Language:
- English
- Publisher:
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Country of origin:
- Germany
- Pages:
- 272
- Dimensions (mm):
- 235x155x17mm
- Weight:
- 1.29kg
Click 'Notify Me' to get an email alert when this item becomes available
Great!
Click on Save to My Library / Lists
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Click on My Library / My Lists and I will take you there
Reviews
Be the first to review Introduction to Circuit Complexity.
Share This Book: