The discrepancy method randomness and complexity Bernard Chazelle.

Chazelle, Bernard:

ISBN 10: 0521770939 / ISBN 13: 9780521770934

Published by Cambridge, Cambridge University Press, 2000

About this Item

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 65 CHA 9780521770934 Sprache: Englisch Gewicht in Gramm: 550.

Seller Inventory # 2502308

Bibliographic Details

• Title: The discrepancy method randomness and complexity Bernard Chazelle.
• Publisher: Cambridge, Cambridge University Press
• Publication Date: 2000
• Language: English
• ISBN 10: 0521770939
• ISBN 13: 9780521770934
• Binding: Hardcover
• Seller catalogs:
  • SA MATHEMATIK

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.