Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Paradigms for Fast Parallel Approximability
Angličtina
146 b
Pripravujeme
Termín neznámy
30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Brožovaná
7.48
€
/
Pevná
15.39
€
Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
51.54
€
/
Brožovaná
28.55
€
/
Brožovaná
25.11
€
/
Brožovaná
12.35
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?