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,420
Discovery Miles 64 200
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,420 Discovery Miles 64 200 | Repayment Terms: R602 pm x 12*

Bookmark and Share

Expected to ship within 12 - 19 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
Promotions
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!

You might also like..

Applied Combinatorics
Alan Tucker Hardcover R5,431 Discovery Miles 54 310
Handbook of Research on Advanced…
Madhumangal Pal, Sovan Samanta, … Hardcover R7,278 Discovery Miles 72 780
Fixed Point Theory and Graph Theory…
Monther Alfuraidan, Qamrul Ansari Hardcover R1,973 Discovery Miles 19 730
Bent Functions - Results and…
Natalia Tokareva Paperback R1,547 Discovery Miles 15 470
Probability - Risk Management…
Daniel Covington Hardcover R994 Discovery Miles 9 940
Introduction to Graph Theory
Robin J. Wilson Paperback R1,369 Discovery Miles 13 690
Spectral Radius of Graphs
Dragan Stevanovic Paperback R1,014 Discovery Miles 10 140
Social Simulation for a Crisis - Results…
Frank Dignum Hardcover R4,951 Discovery Miles 49 510
Essential Topics in Combinatorics
Lucas Lincoln Hardcover R3,140 Discovery Miles 31 400
Counting: Solutions Manual (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R1,164 Discovery Miles 11 640
Counting (2nd Edition)
Khee Meng Koh, Eng Guan Tay Paperback R803 Discovery Miles 8 030
Research Trends in Graph Theory and…
Daniela Ferrero, Leslie Hogben, … Hardcover R3,543 Discovery Miles 35 430

See more

Partners