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

£159.20

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: 159.2 GBP
Availability: InStock

Algorithms

It has never been this cheap. We have no record of a lower price.

£159 today · cheaper than every other day in the last 24 months

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 594 days • 594 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 594 days • 6 price levels

Days at Price

Current Price

Price Analysis

Most common price: £165 (286 days, 48.1%)

Price range: £159 - £192

Price levels: 6 different prices over 594 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: Hardcover
ASIN: 1138070831
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 18 February 2019
Listed Since: 03 February 2018

Barcode

No barcode data available

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

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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)

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

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

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

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

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)

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

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

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

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

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

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

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

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

The Discrete Math Workbook: A Companion Manual Using Python (Texts in Computer Science)

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

Introduction to Combinatorial Designs (Discrete Mathematics and Its Applications)

A Path to Combinatorics for Undergraduates: Counting Strategies

Combinatorics of Permutations (Discrete Mathematics and Its Applications)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)