Randomized Algorithms: Approximation, Generation, and Counting

Name: Randomized Algorithms: Approximation, Generation, and Counting
Brand: Springer Nature
SKU: 9781447106951
Availability: InStock

Best Price (Coupon Required):
Buy Randomized Algorithms: Approximation, Generation, and Counting for $76.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $84.99 - $84.99

BEST PRICE

Single Product Purchase

$76.50

@ Link.springer.com with extra coupon

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 @ Link.springer.com		$84.99	$84.99		10% OFF This deals requires coupon	$76.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

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

N/A

Available Sizes

N/A