Computational complexity of counting and sampling
Auteur :
Miklos, Istvan
Éditeur :
Taylor & Francis Ltd
ISBN :
9781138035577
Date de publication :
20 févr. 2019
Dimensions :
23,4 x 15,6 cm
Poids :
598 g
Langue :
Anglais
Pays d'origine :
Grande Bretagne
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.