Introduction to Circuit Complexity / Texts in Theoretical Computer Science. An EATCS Series (PDF)
A Uniform Approach
(Sprache: Englisch)
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...
sofort als Download lieferbar
Printausgabe Fr. 89.90
eBook (pdf)
Fr. 88.50
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Introduction to Circuit Complexity / Texts in Theoretical Computer Science. An EATCS Series (PDF)“
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.
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.
Bibliographische Angaben
- Autor: Heribert Vollmer
- 2013, 1999, 272 Seiten, Englisch
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3662039273
- ISBN-13: 9783662039274
- Erscheinungsdatum: 17.04.2013
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 23 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Introduction to Circuit Complexity / Texts in Theoretical Computer Science. An EATCS Series"
0 Gebrauchte Artikel zu „Introduction to Circuit Complexity / Texts in Theoretical Computer Science. An EATCS Series“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Introduction to Circuit Complexity / Texts in Theoretical Computer Science. An EATCS Series".
Kommentar verfassen