Cargando…
An Introduction to Online Computation Determinism, Randomization, Advice /
This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing prob...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2016.
|
| Edición: | 1st ed. 2016. |
| Colección: | Texts in Theoretical Computer Science. An EATCS Series,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-42749-2 | ||
| 003 | DE-He213 | ||
| 005 | 20220118121251.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 161031s2016 sz | s |||| 0|eng d | ||
| 020 | |a 9783319427492 |9 978-3-319-42749-2 | ||
| 024 | 7 | |a 10.1007/978-3-319-42749-2 |2 doi | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Komm, Dennis. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 3 | |a An Introduction to Online Computation |h [electronic resource] : |b Determinism, Randomization, Advice / |c by Dennis Komm. |
| 250 | |a 1st ed. 2016. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2016. | |
| 300 | |a XV, 349 p. 58 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a Texts in Theoretical Computer Science. An EATCS Series, |x 1862-4502 | |
| 505 | 0 | |a Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs. | |
| 520 | |a This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. 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. | ||
| 650 | 0 | |a Computer science. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Algorithms. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783319427478 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319427485 |
| 776 | 0 | 8 | |i Printed edition: |z 9783319826530 |
| 830 | 0 | |a Texts in Theoretical Computer Science. An EATCS Series, |x 1862-4502 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-319-42749-2 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||