Computational Complexity of Counting and Sampling - Miklos, Istvan (Renyi Institute, Budapest, Hungary)
113,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
57 °P sammeln
  • Broschiertes Buch

The purpose of the book is to give a comprehensive and detailed introduction to the computationalcomplexity 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.

Andere Kunden interessierten sich auch für
Produktbeschreibung
The purpose of the book is to give a comprehensive and detailed introduction to the computationalcomplexity 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.
Autorenporträt
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.