Distinguished Dissertations : Approximation, Generation, and Counting - Russ Bubley

Instant online reading.
Don't wait for delivery!
Go digital and save!

Distinguished Dissertations

Approximation, Generation, and Counting

By: Russ Bubley

Write A Review

Paperback | 16 September 2011

At a Glance

Paperback
176 Pages

Dimensions(cm)
23.5 x 15.49 x 0.97

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

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.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $0.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.