+612 9045 4394
Introduction to Circuit Complexity : A Uniform Approach - Heribert Vollmer

Introduction to Circuit Complexity

A Uniform Approach

Hardcover Published: 23rd June 1999
ISBN: 9783540643104
Number Of Pages: 272

Share This Book:


or 4 easy payments of $36.74 with Learn more
Ships in 5 to 9 business days

Other Available Editions (Hide)

  • Paperback View Product Published: 8th December 2010
    Ships in 5 to 9 business days

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.

Introductionp. 1
Complexity Measures and Reductionsp. 5
Relations to Other Computation Modelsp. 35
Lower Boundsp. 79
The NC Hierarchyp. 107
Arithmetic Circuitsp. 173
Polynomial Time and Beyondp. 215
Mathematical Preliminariesp. 233
Bibliographyp. 241
List of Figuresp. 255
Author Indexp. 257
Subject Indexp. 261
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540643104
ISBN-10: 3540643109
Series: Texts in Theoretical Computer Science
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 272
Published: 23rd June 1999
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 24.08 x 15.9  x 1.93
Weight (kg): 0.5