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

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

The book covers three topics: Counting problems that are solvable in polynomial running time; Approximation of algorithms for counting and sampling; Holographic algorithms.

First, it opens with the basics such as the algorithmic point of view, dynamic programming algorithms and theoretical computer science point of view. Later, the book expands its scope to focus on advanced topics like stochastic approximations of counting computational 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.

• 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