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,553
Discovery Miles 25 530
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,553 Discovery Miles 25 530 | Repayment Terms: R239 pm x 12*

Bookmark and Share

Expected to ship within 9 - 15 working days

Donate to Against Period Poverty

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
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,183 Discovery Miles 51 830
Code Based Secret Sharing Schemes…
Patrick Sole, Selda Calkavur, … Hardcover R2,261 Discovery Miles 22 610
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,090 Discovery Miles 70 900
Probability - Risk Management…
Daniel Covington Hardcover R936 Discovery Miles 9 360
Mesh - Eine Reise Durch Die Diskrete…
Beau Janzen, Konrad Polthier Book R176 Discovery Miles 1 760
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,723 Discovery Miles 47 230
Boolean Structures: Combinatorics…
Gennaro Auletta Hardcover R2,985 Discovery Miles 29 850
Research Trends in Graph Theory and…
Daniela Ferrero, Leslie Hogben, … Hardcover R3,259 Discovery Miles 32 590
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R2,990 Discovery Miles 29 900
Galois Covers, Grothendieck-Teichmuller…
Frank Neumann, Sibylle Schroll Hardcover R4,370 Discovery Miles 43 700
Magic Graphs
Alison M. Marr, W.D. Wallis Hardcover R2,019 R1,866 Discovery Miles 18 660
Advanced Studies in Behaviormetrics and…
Tadashi Imaizumi, Atsuho Nakayama, … Hardcover R3,594 Discovery Miles 35 940

See more

Partners