Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
The Discrepancy Method: Randomness and Complexity

The Discrepancy Method: Randomness and Complexity

Chazelle, Bernard
Chazelle, B.

Hardcover

General ComputersGeneral Mathematics

ISBN10: 0521770939
ISBN13: 9780521770934
Publisher: Cambridge University Press
Published: Jul 24 2000
Pages: 494
Weight: 1.73
Height: 1.20 Width: 6.35 Depth: 9.30
Language: English
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.

Also in

General Computers

View All