0
Your cart

Your cart is empty

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

Buy Now

Computational Complexity of Counting and Sampling (Paperback) Loot Price: R2,669
Discovery Miles 26 690
Computational Complexity of Counting and Sampling (Paperback): Istvan Miklos

Computational Complexity of Counting and Sampling (Paperback)

Istvan Miklos

Series: Discrete Mathematics and Its Applications

 (sign in to rate)
Loot Price R2,669 Discovery Miles 26 690 | Repayment Terms: R250 pm x 12*

Bookmark and Share

Expected to ship within 9 - 15 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 23mm (L x W x T)
Format: Paperback
Pages: 390
ISBN-13: 978-1-138-03557-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
Promotions
LSN: 1-138-03557-2
Barcode: 9781138035577

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!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,304 Discovery Miles 53 040
Introduction to Graph Theory
Robin J. Wilson Paperback R1,263 Discovery Miles 12 630
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,398 Discovery Miles 73 980
Forbidden Configurations in Discrete…
David Eppstein Hardcover R2,794 Discovery Miles 27 940
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,372 Discovery Miles 23 720
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R2,030 R1,915 Discovery Miles 19 150
The Math Behind the Magic - Fascinating…
Ehrhard Behrends Paperback R931 Discovery Miles 9 310
Probability - Risk Management…
Daniel Covington Hardcover R956 Discovery Miles 9 560
Bent Functions - Results and…
Natalia Tokareva Paperback R1,498 Discovery Miles 14 980
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R179 Discovery Miles 1 790
Spectral Radius of Graphs
Dragan Stevanovic Paperback R976 Discovery Miles 9 760
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,833 Discovery Miles 48 330

See more

Partners