Nehodí sa? Žiadny problém! U nás môžete do 30 dní vrátiť
S darčekovým poukazom nešliapnete vedľa. Obdarovaný si za darčekový poukaz môže vybrať čokoľvek z našej ponuky.
30 dní na vrátenie tovaru
This textbook explains online computation in different settings, with particular emphasis on the paging problem and advice complexity. The book is organized into chapters on randomization, advice complexity, 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?