Introduction to Circuit Complexity

Lieferzeit: Lieferbar innerhalb 14 Tagen

80,24 

A Uniform Approach, Texts in Theoretical Computer Science. An EATCS Series

ISBN: 3540643109
ISBN 13: 9783540643104
Autor: Vollmer, Heribert
Verlag: Springer Verlag GmbH
Umfang: xi, 272 S.
Erscheinungsdatum: 23.06.1999
Auflage: 1/1999
Produktform: Gebunden/Hardback
Einband: Gebunden

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.

Artikelnummer: 4728290 Kategorie:

Beschreibung

Herstellerkennzeichnung:


Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

E-Mail: juergen.hartmann@springer.com

Das könnte Ihnen auch gefallen …