Computational Complexity of Counting and Sampling

7,462.00

In stock


Compare
  Ask a Question   Chat Now
Category:

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

Additional information

Author

Binding

ISBN

Pages

Publication Month & Year

Publisher

0 out of 5
books.dailylawtimes@gmail.com
7737033336

General Inquiries

There are no inquiries yet.

Main Menu

Computational Complexity of Counting and Sampling

7,462.00

Add to Cart
Chat Now
Chat Now
Questions, doubts, issues? We're here to help you!
Connecting...
None of our operators are available at the moment. Please, try again later.
Our operators are busy. Please try again later
:
:
:
Have you got question? Write to us!
:
:
This chat session has ended
Was this conversation useful? Vote this chat session.
Good Bad