Theory of Semi-feasible Algorithms
(Sprache: Englisch)
This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time,...
Leider schon ausverkauft
versandkostenfrei
Buch
123.04 €
61 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Theory of Semi-feasible Algorithms “
Klappentext zu „Theory of Semi-feasible Algorithms “
This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues.Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.
Inhaltsverzeichnis zu „Theory of Semi-feasible Algorithms “
1. Introduction to Semi-Feasible Computation.- 2. Advice.- 3. Lowness.- 4. Hardness for Complexity Classes.- 5. Closures.- 6. Generalizations and Related Notions.- A. Definitions of Reductions and Complexity Classes, and Notation List.- A.1 Reductions.- A.2 Complexity Classes.- A.3 Some Other Notation.- References.
Bibliographische Angaben
- Autoren: Lane A. Hemaspaandra , Leen Torenvliet
- 2002, 2003, 150 Seiten, Maße: 16 x 24,1 cm, Gebunden, Englisch
- Verlag: Springer
- ISBN-10: 3540422005
- ISBN-13: 9783540422006
- Erscheinungsdatum: 28.10.2002
Sprache:
Englisch
Rezension zu „Theory of Semi-feasible Algorithms “
From the reviews:
Kommentar zu "Theory of Semi-feasible Algorithms"
0 Gebrauchte Artikel zu „Theory of Semi-feasible Algorithms“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Theory of Semi-feasible Algorithms".
Kommentar verfassen