You might also like

More about Randomized Algorithms: Approximation, Generation, and Counting

• Book details
• Synopsis
• Trending among others

You get 249 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

• Full title: Randomized Algorithms: Approximation, Generation, and Counting
• Author: Russ Bubley
• Language: English
• Binding: Paperback
• Number of pages: 152
• EAN: 9781447111801
• ISBN: 144711180X
• ID: 06794617
• Publisher: Springer London Ltd
• Weight: 277 g
• Dimensions: 235 × 155 × 10 mm
• Date of publishing: 16. September 2011

Trending among others

---

---

---