}

PayPal accepted MORE INFO

Close Notification

Your cart does not contain any items

Computational Complexity of Counting and Sampling

Istvan Miklos (Renyi Institute, Budapest, Hungary)

$158.00

Paperback

We can order this in for you
How long will it take?

QTY:

CRC Press
20 February 2019
Combinatorics & graph theory; Algorithms & data structures
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 following topics: Counting and sampling problems that are solvable in polynomial running time, including holographic algorithms; #P-complete counting problems; and approximation algorithms for counting and sampling.

First, it opens with the basics, such as the theoretical computer science background and dynamic programming algorithms. Later, the book expands its scope to focus on advanced topics, like stochastic approximations of counting discrete mathematical objects and holographic algorithms. After finishing the book, readers will agree that the subject is well covered, as the book starts with the basics and gradually explores the more complex aspects of the topic.

Features:

Each chapter includes exercises and solutions Ideally written for researchers and scientists Covers all aspects of the topic, beginning with a solid introduction, before shifting to computational complexity's more advanced features, with a focus on counting and sampling
By:   Istvan Miklos (Renyi Institute Budapest Hungary)
Imprint:   CRC Press
Country of Publication:   United Kingdom
Dimensions:   Height: 235mm,  Width: 156mm, 
Weight:   544g
ISBN:   9781138035577
ISBN 10:   1138035572
Series:   Discrete Mathematics and Its Applications
Pages:   390
Publication Date:   20 February 2019
Audience:   College/higher education ,  College/higher education ,  Primary ,  Primary
Format:   Paperback
Publisher's Status:   Active
1. Background on computational complexity 2. Algebraic dynamic programming and monotone computations 3. Linear algebraic algorithms. The power of subtracting 4. #P-complete counting problems 5. Holographic algorithms 6. Methods of random generations 7. Mixing of Markov chains and their applications in the theory of counting and sampling 8. Approximable counting and sampling problems

Istvan Miklos is a Hungarian mathematician and bioinformatician at the Renyi 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.

See Also

Pearls of Discrete Mathematics

Martin Erickson (Truman State University,...

Paperback

The Mathematics of Chip-Firing

Caroline J. Klivans

Paperback

A Java Library of Graph Algorithms...

Hang T. Lau

Paperback

Algebraic Curves in Cryptography...

San Ling (Nanyang Technological...

Paperback

Authentication Codes and Combinatorial...

Dingyi Pei

Paperback