Proizvod vam ne odgovara? Nema veze! Proizvode možete vratiti do 30 dana
S poklon bonom ne možete pogriješiti. Za poklon bon primatelj može odabrati bilo što iz naše ponude.
Do 30 dana za povrat
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?
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?