Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Computational Complexity of Counting and Sampling
part of the Discrete Mathematics and Its Applications series
- Binding:
- Paperback
- Pages:
- 408
- Published:
- February 19, 2019
- Dimensions:
- 233x158x23 mm.
- Weight:
- 600 g.
In stock
Delivery:
3-5 business days
Expected delivery: December 1, 2024
Description of Computational Complexity of Counting and Sampling
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.
User ratings of Computational Complexity of Counting and Sampling
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Computational Complexity of Counting and Sampling can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
