Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications) - Image 1

£90.24

CRC Press Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)

Name: Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)
Brand: CRC Press
Price: 90.24 GBP
Availability: InStock

Algorithms

About as cheap as it gets. The only time it was cheaper was 3 months ago.

£90 today · all-time low £90 (Apr 2026) · usually the usual

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 24 days • 24 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 24 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £91 (14 days, 58.3%)

Price range: £90 - £91

Price levels: 2 different prices over 24 days

Description

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

Product Specifications

Brand: CRC Press
Format: paperback
ASIN: 1138035572
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 25 February 2019
Listed Since: 30 August 2016

Barcode

No barcode data available

CRC Press Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)

About as cheap as it gets. The only time it was cheaper was 3 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Computational Complexity of Counting and Sampling (Discrete Mathematics and Its Applications)

Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zürich)

Sampling in Combinatorial and Geometric Set Systems (Mathematical Surveys and Monographs)

Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 (Progress in Computer Science and Applied Logic, 26)

Mathematics and Computer Science: Algorithims, Trees, Combinatorics and Probabilities (Trends in Mathematics)

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

Handbook of Discrete and Combinatorial Mathematics: Discrete Mathematics and its Applications

Springer - Patterns in Permutations and Words Book

Computational Complexity: A Modern Approach

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Algorithms and Theory of Computation Handbook, Volume 1: General Concepts and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

50 years of Combinatorics, Graph Theory, and Computing (Discrete Mathematics and Its Applications)

Limits of Computation: An Introduction to the Undecidable and the Intractable

CRC Press Combinatorial Scientific Computing: 12 - CRC Press

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: 13889 (Lecture Notes in Computer Science, 13889)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Problems on Algorithms: A Comprehensive Exercise Book for Students in Software Engineering

Art of Computer Programming, The, Volumes 1-4B, Boxed Set: Fundamental Algorithms / Seminumerical Algorithms / Sorting and Searching / Combinatorial ... Part 1 / Combinatorial Algorithms, Part 2

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization)