Computational complexity of counting and sampling /

Computational Complexity of Counting and Sampling provides readers with comprehensive and detailed coverage of the subject of computational complexity. It is primarily geared toward researchers in enumerative combinatorics, discrete mathematics, and theoretical computer science. The book covers the...

Full description

Bibliographic Details

Main Author:	Miklós, István (Mathematician) (Author)
Corporate Author:	Taylor & Francis
Format:	eBook
Language:	English
Published:	Boca Raton, FL : CRC Press, Taylor & Francis Group, [2019]
Series:	Discrete mathematics and its applications.
Subjects:	Computational complexity. Sampling (Statistics) Complexité de calcul (Informatique) Échantillonnage (Statistique) MATHEMATICS > General. MATHEMATICS > Arithmetic. MATHEMATICS > Combinatorics. Computational complexity Electronic books.
Online Access:	Connect to the full text of this electronic book