000			a
999			_c29695 _d29695
008			191120b xxu||||| |||| 00| 0 eng d
020			_a9781138035577
082			_a511.352 _bMIK
100			_aMiklos, Istvan
245			_aComputational complexity of counting and sampling
260			_aBoca Raton _bChapman and Hall/ CRC _c2018
300			_axvii, 390 p. _c23 cm.
365			_b74.99 _cGBP _d93.50
490			_aDiscrete mathematics and its applications
504			_aIncludes bibliographical references.
520			_aThe 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
650			_aComputational complexity
650			_aSampling Statistics
650			_aCombinatorics
650			_aArithmetic
942			_2ddc _cBK