Computational complexity of counting and sampling / István Miklós.
"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 samplin...
| Uniform Title: | Discrete mathematics and its applications.
|
|---|---|
| Main Author: | |
| Language: | English |
| Published: |
Boca Raton :
CRC Press, Taylor & Francis Group,
[2019]
|
| Series: | Discrete mathematics and its applications.
|
| Subjects: | |
| Physical Description: | xvii, 390 pages ; 23 cm. |
| Format: | Book |