Introduction to Circuit Complexity - A Uniform Approach (Hardcover, 1999 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Texts in Theoretical Computer Science. An EATCS Series
Release date:	June 1999
First published:	1999
Authors:	Heribert Vollmer
Dimensions:	235 x 155 x 17mm (L x W x T)
Format:	Hardcover
Pages:	272
Edition:	1999 ed.
ISBN-13:	978-3-540-64310-4
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation
LSN:	3-540-64310-9
Barcode:	9783540643104

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!