20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Randomized Algorithms: Approximation, Generation, and Counting - Russ Bubley

English
2011-09-16
€135.50 €169.38

-20% with code BOOKS

In stock at our supplier

Shipping in 12-18 days

30-day return policy

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 A ... Full description

You May Also Like

Description

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.

More Information

Author Russ Bubley
Publisher Springer London
Series Distinguished Dissertations
Release year 2011
Cover type Softcover
EAN 9781447111801
Write Your Own Review
You're reviewing: Randomized Algorithms: Approximation, Generation, and Counting
Your Rating:

Goodreads Reviews

€135.50 €169.38