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.
| ISBN: | 9781447111801 |
| Publication date: | 16th September 2011 |
| Author: | Russ Bubley |
| Publisher: | Springer an imprint of Springer London |
| Format: | Paperback |
| Pagination: | 152 pages |
| Series: | Distinguished Dissertations |
| Genres: |
Algorithms and data structures Stochastics Maths for computer scientists Probability and statistics Mathematical theory of computation Computer programming / software engineering |
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 features in the following genres: Algorithms and data structures, Stochastics, Maths for computer scientists, Probability and statistics, Mathematical theory of computation, Computer programming / software engineering
Paperback. Not Available.
Randomized Algorithms was written by Russ Bubley and published by Springer an imprint of Springer London
Randomized Algorithms has 152 pages
Yes it is part of Distinguished Dissertations series