Contact
Hoe winkelen bij ons werkt
Bezorging
Winkelgids
Concentration of Measure for the Analysis of Randomized Algorithms
Engels
430 b
Tot 30 dagen retourrecht
Klanten kochten ook
/
Paperback
16.98
€
/
Paperback
13.16
€
/
Paperback
14.36
€
Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff–Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff–Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
Informatie over het boek
Engels
Geef dit boek vandaag nog cadeau
Dat gaat heel eenvoudig
1 Voeg het boek toe aan je winkelwagentje en selecteer Als cadeau bezorgen 2 Je krijgt van ons per omgaand een voucher 3 Het boek wordt bezorgd op het adres van de ontvangerDit vind je misschien ook interessant
/
Paperback
27.43
€
/
Paperback
26.63
€
/
Paperback
50.15
€
/
Paperback
34.47
€
/
Paperback
7.13
€
/
Paperback
72.66
€
Hoi! Ik ben Libroamiko, je boekadviseur.
Hoe kan ik je helpen?