The Discrepancy Method: Randomness and Complexity

Chazelle, Bernard

ISBN 10: 0521003571 / ISBN 13: 9780521003575

Published by Cambridge University Press, 2002

About this Item

Ask for photos!Clean pages with no markings. Minor wear on edges and corners.Ships same day in most cases!

Seller Inventory # 07-24-34-019

Bibliographic Details

• Title: The Discrepancy Method: Randomness and Complexity
• Publisher: Cambridge University Press
• Publication Date: 2002
• Language: English
• ISBN 10: 0521003571
• ISBN 13: 9780521003575
• Binding: paperback
• Condition: Clean pages with no markings.

About this title

Synopsis

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.

Book Description

Randomization is one of the great resources in algorithm design and also one of its great mysteries. Although randomization seems to provide algorithms with more power, there is no proof that it is indeed the case. This book examines the discrepancy method, which may be the 'missing link' between randomness and complexity. The text discusses a selection of important topics illustrating the fruitfulness of this link. Several of the most exciting recent results in algorithms and complexity are covered, such as communication complexity, pseudo-randomness, rapidly mixing Markov chains, and multidimensional searching. With minimal pre-requisites, this book should appeal to students as well as researchers in computer science, operations research, pure and applied mathematics, and engineering.