Algorithmics for Hard Problems / Texts in Theoretical Computer Science. An EATCS Series (PDF)
Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
(Sprache: Englisch)
This book is an introduction to the methods of designing algorithms for hard computing tasks. This area has developed very dynamically in the last years and is one of the kernels of current research in algorithm and complexity theory.
The book mainly...
The book mainly...
sofort als Download lieferbar
eBook (pdf)
Fr. 106.50
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Algorithmics for Hard Problems / Texts in Theoretical Computer Science. An EATCS Series (PDF)“
This book is an introduction to the methods of designing algorithms for hard computing tasks. This area has developed very dynamically in the last years and is one of the kernels of current research in algorithm and complexity theory.
The book mainly concentrates on approximate, randomized and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. There exist several monographs specializing in some of these methods, but no book systematically explains and compares all main possibilities of attacking hard computing problems. Since the topic is fundamental for the university study in computer science and essential for the transfer of formal methods to the practice, the aim of the book is to close this gap by providing at once a textbook for graduate students and a handbook for practitioners dealing with hard computing problems.
The book mainly concentrates on approximate, randomized and heuristic algorithms, and on the theoretical and experimental comparison of these approaches according to the requirements of the practice. There exist several monographs specializing in some of these methods, but no book systematically explains and compares all main possibilities of attacking hard computing problems. Since the topic is fundamental for the university study in computer science and essential for the transfer of formal methods to the practice, the aim of the book is to close this gap by providing at once a textbook for graduate students and a handbook for practitioners dealing with hard computing problems.
Bibliographische Angaben
- Autor: Juraj Hromkovic
- 2013, 2001, 494 Seiten, Englisch
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3662046164
- ISBN-13: 9783662046166
- Erscheinungsdatum: 14.03.2013
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 40 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Algorithmics for Hard Problems / Texts in Theoretical Computer Science. An EATCS Series"
0 Gebrauchte Artikel zu „Algorithmics for Hard Problems / Texts in Theoretical Computer Science. An EATCS Series“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Algorithmics for Hard Problems / Texts in Theoretical Computer Science. An EATCS Series".
Kommentar verfassen