When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Computational Complexity of Counting and Sampling, Paperback by Miklos, Istvan, ISBN 1138035572, ISBN-13 9781138035577, Brand New, Free shipping in the US "The purpose of th is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. Th will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms"--
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.