Introduction to Circuit Complexity
(Sprache: Englisch)
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
Leider schon ausverkauft
versandkostenfrei
Buch
Fr. 120.90
inkl. MwSt.
- Kreditkarte, Paypal, Rechnungskauf
- 30 Tage Widerrufsrecht
Produktdetails
Produktinformationen zu „Introduction to Circuit Complexity “
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
Klappentext zu „Introduction to Circuit Complexity “
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
Inhaltsverzeichnis zu „Introduction to Circuit Complexity “
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.
Bibliographische Angaben
- Autor: Heribert Vollmer
- 1999, 272 Seiten, Masse: 15,9 x 24 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 3540643109
- ISBN-13: 9783540643104
- Erscheinungsdatum: 23.06.1999
Sprache:
Englisch
Kommentar zu "Introduction to Circuit Complexity"
0 Gebrauchte Artikel zu „Introduction to Circuit Complexity“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Introduction to Circuit Complexity".
Kommentar verfassen