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

£56.64

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

Name: Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zurich)
Brand: Birkhauser
Price: 56.64 GBP
Availability: InStock

Algorithms

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

£57 today · all-time low £55 (May 2026) · usually £57

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 67 days · 67 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 67 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £57 (39 days, 58.2%)

Price range: £55 - £58

Price levels: 3 different prices over 67 days

Description

These notes had their origin in a postgraduate lecture series I gave at the Eid genossiche Technische Hochschule (ETH) in Zurich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut fUr Mathematik at ETH, for providing the ideal opportunity to develop and present this material in what I hope is a reasonably coherent manner, and also for encouraging and assisting me to record the proceedings in these lecture notes. The subject of the lecture series was counting (of combinatorial structures) and related topics, viewed from a computational perspective. As we shall see, "related topics" include sampling combinatorial structures (being computationally equivalent to approximate counting via efficient reductions), evaluating partition functions (being weighted counting) and calculating the volume of bodies (being counting in the limit). We shall be inhabiting a different world to the one conjured up by books with titles like Combinatorial Enumeration or Graphical Enumeration. There, the prob lems are usually parameterised on a single integer parameter n, and the required solutions are closed form or asymptotic estimates obtained using very refined and precise analytical tools.

Product Specifications

Brand: Birkhauser
Format: paperback
ASIN: 3764369469
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 23 January 2003
Listed Since: 18 January 2007

Barcode

No barcode data available

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

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

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

Surveys in Combinatorics, 1999: 267 (London Mathematical Society Lecture Note Series, Series Number 267)

Combinatorics: The Art of Counting (Graduate Studies in Mathematics)

A Path to Combinatorics for Undergraduates: Counting Strategies

Surveys in Combinatorics 2009: 365 (London Mathematical Society Lecture Note Series, Series Number 365)

Surveys in Combinatorics 2003: 307 (London Mathematical Society Lecture Note Series, Series Number 307)

Introduction to Combinatorics (Discrete Mathematics and Its Applications)

Surveys in Combinatorics 2005: 327 (London Mathematical Society Lecture Note Series, Series Number 327)

Introduction to Combinatorics (Discrete Mathematics and Its Applications)

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

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

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

Surveys in Combinatorics 2017: 440 (London Mathematical Society Lecture Note Series, Series Number 440)

CRC Press Combinatorics and Number Theory of Counting Sequences

A First Course in Enumerative Combinatorics (Pure and Applied Undergraduate Texts)

Applied Combinatorics, Third Edition (Discrete Mathematics and Its Applications)

Combinatorial Reasoning: An Introduction to the Art of Counting

CRC Press Handbook of Enumerative Combinatorics - Mathematics

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory: An Introduction to Enumeration and Graph Theory (Second Edition)

How to Count: An Introduction to Combinatorics, Second Edition (Discrete Mathematics & Its Application)

Chapman and Hall/CRC Handbook of Enumerative Combinatorics

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

Walk Through Combinatorics, A: An Introduction To Enumeration And Graph Theory (Fourth Edition)