Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact firstname.lastname@example.org providing details of the course you are teaching.
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.Read more
- Several of the most exciting recent results in algorithms and complexity are covered
- Self-contained, with much of the mathematical background provided. Chapters are mostly independent, so the book can be used as reference.
- A potential classic along the lines of The Probabilistic Method by Alon and Spencer (published by Wiley)
Reviews & endorsements
"Chazelle writes well, treats the reader generously, and works passionately to find the common threads in a plethora of important, late-breaking developments at the crossroads of mathematics and computer science. Both as personal testament and crafted exposition, this invitation into ongoing research reads with the feel of an intimate audience with an enthusiastic leading expert. Upper division undergraduates through professionals." Choice
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: January 2002
- format: Paperback
- isbn: 9780521003575
- length: 494 pages
- dimensions: 229 x 152 x 27 mm
- weight: 0.652kg
- contains: 160 b/w illus.
- availability: Available
Table of Contents
1. Combinatorial discrepancy
2. Upper bounds in geometric discrepancy
3. Lower bounds in geometric discrepancy
5. Geometric searching
6. Complexity lower bounds
7. Convex hulls and Voronoi diagrams
8. Linear programming and extensions
10. Communication complexity
11. Minimum spanning trees
A. Probability theory
B. Harmonic analysis
C. Convex geometry.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×