Introduction to Circuit Complexity - Vollmer, Heribert
Statt 55,99 €**
49,99 €
versandkostenfrei*

inkl. MwSt.
**Früherer Preis
Sofort lieferbar
Ohne Risiko: Verlängerte Rückgabefrist bis zum 10.01.2022
25 °P sammeln
  • Gebundenes Buch

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 automata-theoretic approaches, and includes extensive discussion of the literature to facilitate further study. It begins with efficient boolean circuits for problems with high practical relevance, 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…mehr

Produktbeschreibung
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 automata-theoretic approaches, and includes extensive discussion of the literature to facilitate further study. It begins with efficient boolean circuits for problems with high practical relevance, 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 algebraic complexity and connections to finite model theory.
  • Produktdetails
  • Texts in Theoretical Computer Science. An EATCS Series
  • Verlag: Springer / Springer, Berlin
  • Artikelnr. des Verlages: 10648923, 978-3-540-64310-4
  • 1999.
  • Erscheinungstermin: 23. Juni 1999
  • Englisch
  • Abmessung: 240mm x 159mm x 18mm
  • Gewicht: 588g
  • ISBN-13: 9783540643104
  • ISBN-10: 3540643109
  • Artikelnr.: 07829961
Inhaltsangabe
1. Complexity Measures and Reductions.- 2. Relations to Other Computation Models.- 3. Lower Bounds.- 4. The NC Hierarchy.- 5. Arithmetic Circuits.- 6. Polynomial Time and Beyond.- Appendix: Mathematical Preliminaries.- A1 Alphabets, Words, Languages.- A2 Binary Encoding.- A3 Asymptotic Behavior of Functions.- A4 Turing Machines.- A5 Logic.- A6 Graphs.- A7 Numbers and Functions.- A8 Algebraic Structures.- A9 Linear Algebra.- List of Figures.- Author Index.