Product Description

An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.

Product Details

• Amazon Sales Rank: #1331641 in Books
• Published on: 1999-07-30
• Original language: English
• Dimensions: 1.10 pounds
• Binding: Hardcover
• 281 pages

Ingram
This advanced handbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the automata-theoretic approaches, and includes an extensive discussion of the literature to facilitate future research.

Book Info
Presents a broad and up to date view of the computational complexity theory of Boolean circuits. Combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study.

From the Back Cover
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.