Computational Complexity of Counting and Sampling
Autor
Istvan Miklos (Renyi Institute, Budapest, Hungary)
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.