Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Randomized Algorithms: Approximation, Generation, and Counting

Randomized Algorithms: Approximation, Generation, and Counting

Bubley, Russ

Paperback

Series: Distinguished Dissertations

General ReferenceGeneral GardeningProbability & Statistics

ISBN10: 144711180X
ISBN13: 9781447111801
Publisher: Springer Nature
Published: Sep 16 2011
Pages: 152
Weight: 0.56
Height: 0.38 Width: 6.14 Depth: 9.21
Language: English
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.

Also in

General Reference

View All