ShopSpell

The Discrepancy Method Randomness and Complexity [Paperback]

$75.99       (Free Shipping)
50 available
  • Category: Books (Computers)
  • Author:  Chazelle, Bernard
  • Author:  Chazelle, Bernard
  • ISBN-10:  0521003571
  • ISBN-10:  0521003571
  • ISBN-13:  9780521003575
  • ISBN-13:  9780521003575
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  494
  • Pages:  494
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-May-2002
  • Pub Date:  01-May-2002
  • SKU:  0521003571-11-MPOD
  • SKU:  0521003571-11-MPOD
  • Item ID: 100275289
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jan 20 to Jan 22
  • Notes: Brand New Book. Order Now.
Explores the link between discrepancy theory and randomized algorithms.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.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.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. Thel.
Add Review