0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Computational Complexity of Counting and Sampling (Hardcover) Loot Price: R6,377
Discovery Miles 63 770
Computational Complexity of Counting and Sampling (Hardcover): Istvan Miklos

Computational Complexity of Counting and Sampling (Hardcover)

Istvan Miklos

Series: Discrete Mathematics and Its Applications

 (sign in to rate)
Loot Price R6,377 Discovery Miles 63 770 | Repayment Terms: R598 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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

General

Imprint: Crc Press
Country of origin: United Kingdom
Series: Discrete Mathematics and Its Applications
Release date: February 2019
First published: 2018
Authors: Istvan Miklos
Dimensions: 234 x 156 x 28mm (L x W x T)
Format: Hardcover
Pages: 390
ISBN-13: 978-1-138-07083-7
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
LSN: 1-138-07083-1
Barcode: 9781138070837

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners