Sale
Computational Complexity Of Counting And Sampling
Taylor & Francis Ltd
$91.68
$89.22
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.
- | By (Author): Istvan Miklos
- | Publisher: Taylor & Francis Ltd
- | Publication Date: Feb 20, 2019
- | Country of Publication: United Kingdom
- | Number of Pages: 390 pages
- | Language: Unknown
- | Binding: Softback
- | ISBN-10: 1138035572
- | ISBN-13: 9781138035577
- By (Author):
- Istvan Miklos
- Publisher:
- Taylor & Francis Ltd
- Publication Date:
- Feb 20, 2019
- Country of Publication:
- United Kingdom
- Language:
- Unknown
- Number of pages:
- 390 pages
- Binding:
- Softback
- ISBN-10:
- 1138035572
- ISBN-13:
- 9781138035577