🎉   Please check out our new website over at books-etc.com.

Seller
Your price
£70.94
Dispatched within 2-3 working days.

Computational Complexity of Counting and Sampling

Discrete Mathematics and Its Applications

By (author) Istvan Miklos
Format: Paperback / softback
Publisher: Taylor & Francis Ltd, London, United Kingdom
Imprint: CRC Press
Published: 20th Feb 2019
Dimensions: w 155mm h 232mm d 21mm
Weight: 598g
ISBN-10: 1138035572
ISBN-13: 9781138035577
Barcode No: 9781138035577
Trade or Institutional customer? Contact us about large order quotes.
Synopsis
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

New & Used

Seller Information Condition Price
-New£70.94
+ FREE UK P & P

What Reviewers Are Saying

Be the first to review this item. Submit your review now