{
"item_title" : "Computational Complexity of Counting and Sampling",
"item_author" : [" Istvan Miklos "],
"item_description" : "The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/13/803/557/1138035572_b.jpg",
"price_data" : {
"retail_price" : "132.99", "online_price" : "132.99", "our_price" : "132.99", "club_price" : "132.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Computational Complexity of Counting and Sampling
Other Available Formats
Overview
The purpose of the book is to give a comprehensive and detailed introduction to the computational
complexity of counting and sampling. The book consists of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9781138035577
- ISBN-10: 1138035572
- Publisher: CRC Press
- Publish Date: February 2019
- Dimensions: 9 x 6.1 x 0.8 inches
- Shipping Weight: 1.25 pounds
- Page Count: 408
Related Categories
