Skip to main content alibris logo
Randomized Algorithms: Approximation, Generation, and Counting - Bubley, Russ
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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 ...

loading
Randomized Algorithms: Approximation, Generation, and Counting 2011, Springer, London

ISBN-13: 9781447111801

Trade paperback

Randomized Algorithms: Approximation, Generation, and Counting 2000, Springer, London, England

ISBN-13: 9781852333256

2001 edition

Hardcover