The Discrepancy Method: Randomness and Complexity
The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites. More information can be found on the book's home page at http://www.cs.princeton.edu/~chazelle/book.html.
1111440176
The Discrepancy Method: Randomness and Complexity
The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites. More information can be found on the book's home page at http://www.cs.princeton.edu/~chazelle/book.html.
74.0 In Stock
The Discrepancy Method: Randomness and Complexity

The Discrepancy Method: Randomness and Complexity

by Bernard Chazelle
The Discrepancy Method: Randomness and Complexity

The Discrepancy Method: Randomness and Complexity

by Bernard Chazelle

Paperback(New Edition)

$74.00 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites. More information can be found on the book's home page at http://www.cs.princeton.edu/~chazelle/book.html.

Product Details

ISBN-13: 9780521003575
Publisher: Cambridge University Press
Publication date: 01/14/2002
Series: Randomness and Complexity
Edition description: New Edition
Pages: 494
Product dimensions: 5.98(w) x 9.02(h) x 1.06(d)

Table of Contents

1. Combinatorial discrepancy; 2. Upper bounds in geometric discrepancy; 3. Lower bounds in geometric discrepancy; 4. Sampling; 5. Geometric searching; 6. Complexity lower bounds; 7. Convex hulls and Voronoi diagrams; 8. Linear programming and extensions; 9. Pseudo-randomness; 10. Communication complexity; 11. Minimum spanning trees; A. Probability theory; B. Harmonic analysis; C. Convex geometry.
From the B&N Reads Blog

Customer Reviews