Computational Complexity of Counting and Sampling - Istvan Miklos
-40% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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.
Võib-olla meeldib sulle ka
Kirjeldus
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.
Lisateave
| Autor | Istvan Miklos |
|---|---|
| Kirjastaja | Taylor & Francis Ltd |
| Väljalaskeaasta | 2019 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9781138035577 |