The Discrepancy Method: Randomness and Complexity Bernard Chazelle

ISBN: 9780521003575

Published: January 14th 2002

Paperback

494 pages


Description

The Discrepancy Method: Randomness and Complexity  by  Bernard Chazelle

The Discrepancy Method: Randomness and Complexity by Bernard Chazelle
January 14th 2002 | Paperback | PDF, EPUB, FB2, DjVu, talking book, mp3, ZIP | 494 pages | ISBN: 9780521003575 | 9.43 Mb

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 tellsMoreThe 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 books home page at http: //www.cs.princeton.edu/ chazelle/book.html.



Enter the sum





Related Archive Books



Related Books


Comments

Comments for "The Discrepancy Method: Randomness and Complexity":


prosunshower.com

©2014-2015 | DMCA | Contact us