.png){kind=logo}
Stock image for illustration purposes only - book cover, edition or condition may vary.
Randomized Algorithms: Approximation, Generation, and Counting
Russ Bubley
€ 126.65
FREE Delivery in Ireland
Description for Randomized Algorithms: Approximation, Generation, and Counting
Paperback. Series: Distinguished Dissertations. Num Pages: 152 pages, biography. BIC Classification: PBT; PBV; UMB; UYAM. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 9. Weight in Grams: 276.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2011
Publisher
Springer London Ltd United Kingdom
Number of pages
152
Condition
New
Series
Distinguished Dissertations
Number of Pages
152
Place of Publication
England, United Kingdom
ISBN
9781447111801
SKU
V9781447111801
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Randomized Algorithms: Approximation, Generation, and Counting