© 1999

Introduction to Circuit Complexity

A Uniform Approach


Table of contents

  1. Front Matter
    Pages I-XI
  2. Heribert Vollmer
    Pages 1-3
  3. Heribert Vollmer
    Pages 5-34
  4. Heribert Vollmer
    Pages 35-78
  5. Heribert Vollmer
    Pages 79-106
  6. Heribert Vollmer
    Pages 107-171
  7. Heribert Vollmer
    Pages 173-214
  8. Heribert Vollmer
    Pages 215-231
  9. Back Matter
    Pages 233-272

About this book


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.


Algorithmus Alphabet Berechnungskomplexität Berechnungsmodell Komplexitätsklassen Schaltkreis algorithms boolean circuits complexity complexity theory computability computational complexity computational methods linear algebra logic

Authors and affiliations

  1. 1.Theoretische InformatikUniversität WürzburgWürzburgGermany

Bibliographic information

Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking