The Discrepancy Method: Randomness and Complexity - Image 1

£61.20

Cambridge University Press The Discrepancy Method: Randomness and Complexity

Name: The Discrepancy Method: Randomness and Complexity
Brand: Cambridge University Press
Price: 61.2 GBP
Availability: InStock

160 b/w illus.

Computer Science

This is the most expensive it has ever been. Walk away.

£61 today · previous high £61 · all-time low £60

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

Historical

Generating forecast...

Price Distribution

Price distribution over 43 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £60 (27 days, 62.8%)

Price range: £60 - £61

Price levels: 2 different prices over 43 days

Description

The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal to students and researchers in computer science, operations research, pure and applied mathematics, and engineering.

Product Specifications

Brand: Cambridge University Press
Model: 160 b/w illus.
Format: hardcover
ASIN: 0521770939
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 24 July 2000
Listed Since: 22 January 2007

Barcode

No barcode data available

Cambridge University Press The Discrepancy Method: Randomness and Complexity

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Concentration of Measure for the Analysis of Randomized Algorithms

Concentration of Measure for the Analysis of Randomized Algorithms

Computability and Randomness: 51 (Oxford Logic Guides)

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

Randomization Methods in Algorithm Design (Series in Discrete Mathematics and Theoretical Computer Science): Dimacs Workshop, December 12-14, 1997

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Communication Complexity (for Algorithm Designers) (Foundations and Trends (R) in Theoretical Computer Science)

Random Networks for Communication: From Statistical Physics to Information Systems: 24 (Cambridge Series in Statistical and Probabilistic Mathematics, Series Number 24)

Dynamics of Information Systems: Algorithmic Approaches: 51 (Springer Proceedings in Mathematics & Statistics, 51)

High-Dimensional Probability: An Introduction with Applications in Data Science: 47 (Cambridge Series in Statistical and Probabilistic Mathematics, Series Number 47)

The Nature of Computation

Groups, Graphs and Random Walks - Cambridge University Press

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

Discrete Mathematics and Game Theory: 22 (Theory and Decision Library C, 22)

The Theory of Algorithms: 23 (Mathematics and its Applications, 23)

Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings: 3669 (Lecture Notes in Computer Science, 3669)

The Theory of Algorithms: 23 (Mathematics and its Applications, 23)

High Dimensional Probability VIII: The Oaxaca Volume: 74 (Progress in Probability, 74)

Birkhauser High Dimensional Probability VIII: The Oaxaca Volume

Algebraic and Geometric Methods in Discrete Mathematics (Contemporary Mathematics): Ams Special Session on Algebraic and Geometric Methods in Applied ... January 11, 2015, San Antonio, Tx

Springer MISC 2018: Modelling and Implementation of Complex Systems

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

A Lifetime of Excursions Through Random Walks and Lévy Processes: A Volume in Honour of Ron Doney’s 80th Birthday: 78 (Progress in Probability, 78)

Mathematical Principles of the Internet, Volume 2: Mathematics (Chapman & Hall/CRC Computer and Information Science Series)