Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications) - Tapa dura

Libro 51 de 67: Discrete Mathematics and Its Applications

Miklos, Istvan

 
9781138070837: Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)
Tapa dura
ISBN 10: 1138070831 ISBN 13: 9781138070837
Editorial: Chapman and Hall/CRC, 2019

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

István Miklós is a Hungarian mathematician and bioinformatician at the Rényi Institute in Budapest. He holds a Ph.D. from Eotvos University in Budapest. His research interests lie in theoretical and applied computer science and combinatorics, particularly in the study of Markov chain, Monte Carlo methods and in sampling and counting combinatorial objects appearing in applied mathematics. He has more than 50 peer-reviewed scientific papers.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Chapman and Hall/CRC
Año de publicación
2019
Idioma
Inglés
ISBN 10 
1138070831
ISBN 13 
9781138070837
Encuadernación
Tapa dura
Número de edición
1
Número de páginas
410
Contacto del fabricante
no disponible
Persona responsable
no disponible

Otras ediciones populares con el mismo título

9781138035577: Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)

Edición Destacada

ISBN 10:  1138035572 ISBN 13:  9781138035577
Editorial: Routledge, 2019
Tapa blanda