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

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

£86.00
Paperback Published: 16/09/2011
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

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.

Publisher: Springer London Ltd
ISBN: 9781447111801

You may also be interested in...

Your review has been submitted successfully.

We would love to hear what you think of Waterstones. Why not review Waterstones on Trustpilot?


Review us on Trustpilot