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.
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.
Introduction to Circuit Complexity: A Uniform Approach
272
Introduction to Circuit Complexity: A Uniform Approach
272Hardcover(1999)
Product Details
| ISBN-13: | 9783540643104 |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Publication date: | 07/30/1999 |
| Series: | Texts in Theoretical Computer Science. An EATCS Series |
| Edition description: | 1999 |
| Pages: | 272 |
| Product dimensions: | 6.10(w) x 9.25(h) x 0.03(d) |