61,95 €*
Versandkostenfrei per Post / DHL
Lieferzeit 4-7 Werktage
This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
Dr. Dennis Komm is a lecturer in the Chair of Information Technology and Education at ETH Zürich. His research interests include approximation algorithms for hard optimization problems, re-optimization of optimization problems, and advice complexity in different setups and environments.
Particular emphasis on the paging problem and advice complexity
Appropriate for undergraduate and graduate students of computer science
Key feature of author's approach is focus on the information which is hidden in a given instance
Includes supplementary material: [...]
Introduction.- Randomization.- Advice Complexity.- The
k
-Server Problem.- Job Shop Scheduling.- The Knapsack Problem.- The Bit Guessing Problem.- Problems on Graphs.
| Erscheinungsjahr: | 2018 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 368 |
| Reihe: | Texts in Theoretical Computer Science. An EATCS Series |
| Inhalt: |
xv
349 S. 58 s/w Illustr. 349 p. 58 illus. |
| ISBN-13: | 9783319826530 |
| ISBN-10: | 3319826530 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: | Komm, Dennis |
| Auflage: | Softcover reprint of the original 1st ed. 2016 |
| Hersteller: |
Springer International Publishing
Texts in Theoretical Computer Science. An EATCS Series |
| Maße: | 235 x 155 x 20 mm |
| Von/Mit: | Dennis Komm |
| Erscheinungsdatum: | 28.06.2018 |
| Gewicht: | 0,557 kg |
Dr. Dennis Komm is a lecturer in the Chair of Information Technology and Education at ETH Zürich. His research interests include approximation algorithms for hard optimization problems, re-optimization of optimization problems, and advice complexity in different setups and environments.
Particular emphasis on the paging problem and advice complexity
Appropriate for undergraduate and graduate students of computer science
Key feature of author's approach is focus on the information which is hidden in a given instance
Includes supplementary material: [...]
Introduction.- Randomization.- Advice Complexity.- The
k
-Server Problem.- Job Shop Scheduling.- The Knapsack Problem.- The Bit Guessing Problem.- Problems on Graphs.
| Erscheinungsjahr: | 2018 |
|---|---|
| Genre: | Informatik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 368 |
| Reihe: | Texts in Theoretical Computer Science. An EATCS Series |
| Inhalt: |
xv
349 S. 58 s/w Illustr. 349 p. 58 illus. |
| ISBN-13: | 9783319826530 |
| ISBN-10: | 3319826530 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: | Komm, Dennis |
| Auflage: | Softcover reprint of the original 1st ed. 2016 |
| Hersteller: |
Springer International Publishing
Texts in Theoretical Computer Science. An EATCS Series |
| Maße: | 235 x 155 x 20 mm |
| Von/Mit: | Dennis Komm |
| Erscheinungsdatum: | 28.06.2018 |
| Gewicht: | 0,557 kg |
Ähnliche Produkte
Lieferzeit 4-7 Werktage
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 2-3 Wochen
Lieferzeit 2-3 Wochen
Lieferzeit 4-7 Werktage
Lieferzeit 1-2 Wochen
Aktuell nicht verfügbar