Non-Fiction Books:

Randomized Algorithms: Approximation, Generation, and Counting

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

Format:

Paperback / softback
$268.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks

Buy Now, Pay Later with:

4 payments of $67.25 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 11-21 June using International Courier

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.
Release date Australia
September 16th, 2011
Author
Audience
  • Professional & Vocational
Edition
Softcover reprint of the original 1st ed. 2001
Illustrations
XX, 152 p.
Pages
152
Dimensions
156x234x9
ISBN-13
9781447111801
Product ID
20746512

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Help & options

Filed under...