Randomized Algorithms: Approximation, Generation, and Counting
Randomized Algorithms: Approximation, Generation, and Counting
Brand
Springer Nature
Manufacturer
N/A
Part Number
0
GTIN
9781447106951
Condition
New
Product Description
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.
Available Colors
Available Sizes
1 Offer
Price Range: $84.99 - $84.99
Price Comparison
Seller | Contact Seller | List Price | On Sale | Shipping | Best Promo | Final Price | Volume Discount | Financing | Availability | Seller's Page |
---|---|---|---|---|---|---|---|---|---|---|
BEST PRICE 1 Product Purchase
|
$84.99 | $84.99 |
|
$84.99 | See Site | In stock | Visit Store |