Theory of Semi-Feasible Algorithms / Monographs in Theoretical Computer Science. An EATCS Series (PDF)
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,...
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
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.
- Autoren: Lane A. Hemaspaandra , Leen Torenvliet
- 2013, 2003, 150 Seiten, Englisch
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3662050803
- ISBN-13: 9783662050804
- Erscheinungsdatum: 17.04.2013
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Größe: 15 MB
- Ohne Kopierschutz
- Vorlesefunktion
Schreiben Sie einen Kommentar zu "Theory of Semi-Feasible Algorithms / Monographs in Theoretical Computer Science. An EATCS Series".
Kommentar verfassen