Tags
Language
Tags
March 2024
Su Mo Tu We Th Fr Sa
25 26 27 28 29 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6

Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)

Posted By: elodar
Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)

Russ Bubley, "Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)"
Springer | English | 2000-12-28 | ISBN: 1852333251 | 152 pages | DJVU | 1.64 mb

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability. When asking questions like 'How many are there?' and 'What does it look like on average?' of families of combinatorial structures, answers are often difficult to find – we can be blocked by seemingly intractable algorithms. Randomized Algorithms shows how to get around the problem of intractability with the Markov chain Monte Carlo method, as well as highlighting the method's natural limits. It uses the technique of coupling before introducing 'path coupling' a new technique which radically simplifies and improves upon previous methods in the area.

Welcome to my AH collection of ebooks at: http://avaxhome.ws/blogs/elodar

You can also connect to my RSS