The Discrepancy Method - Randomness and Complexity (Paperback, Revised)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	2002
First published:	2000
Authors:	Bernard Chazelle
Dimensions:	229 x 152 x 27mm (L x W x T)
Format:	Paperback - Trade
Pages:	494
Edition:	Revised
ISBN-13:	978-0-521-00357-5
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Mathematics > Number theory > General Promotions
LSN:	0-521-00357-1
Barcode:	9780521003575

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!