{ "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/807/083/1138070831_b.jpg", "price_data" : { "retail_price" : "305.00", "online_price" : "305.00", "our_price" : "305.00", "club_price" : "305.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details