Computational Complexity of Counting and Sampling by Miklos, Istvan

Computational Complexity of Counting and Sampling (Paperback) (ISBN-13: 9781138035577)

Vendor: Istvan Miklos
Product type: Books
Format: Paperback
$126.99
$126.99
$126.99
Subtotal: $126.99
Computational Complexity of Counting and Sampling by Miklos, Istvan

Computational Complexity of Counting and Sampling

$126.99
Computational Complexity of Counting and Sampling by Miklos, Istvan

Computational Complexity of Counting and Sampling

$126.99
Format: Paperback
Description
Description
x
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.


Author: Istvan Miklos
ISBN-10: 1138035572
ISBN-13: 9781138035577
Publisher: CRC Press
Language: English
Published: 02/20/2019
Pages: 408
Format: Paperback
Weight: 1.25lbs
Size: 9.00h x 6.10w x 0.80d

Review Citation(s):
Choice 10/01/2019
By Istvan Miklos
By Istvan Miklos
x

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.

Recently Viewed Products