Computational complexity of counting and sampling
- Boca Raton Chapman and Hall/ CRC 2018
- xvii, 390 p. 23 cm.
- Discrete mathematics and its applications .
Includes bibliographical references.
The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book 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