We a good story
Quick delivery in the UK

Computational Complexity of Counting and Sampling

About 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.

Show more
  • Language:
  • English
  • ISBN:
  • 9781138070837
  • Binding:
  • Hardback
  • Pages:
  • 408
  • Published:
  • February 17, 2019
  • Dimensions:
  • 240x162x28 mm.
  • Weight:
  • 756 g.
Delivery: 2-3 weeks
Expected delivery: December 15, 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



Find similar books
The book Computational Complexity of Counting and Sampling can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.