Не ви допада? Няма проблеми! При нас имате възможност за връщане в рамките на 30 дни
Няма да сбъркате с подаръчен ваучер. Получателят може да избере нещо от нашия асортимент с подаръчен ваучер.
30 дни за връщане на стоката
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?