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.
"synopsis" may belong to another edition of this title.
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.
"Chazelle writes well, treats the reader generously, and works passionately to find the common threads in a plethora of important, late-breaking developments at the crossroads of mathematics and computer science. Both as personal testament and crafted exposition, this invitation into ongoing research reads with the feel of an intimate audience with an enthusiastic leading expert. Upper division undergraduates through professionals." Choice
"About this title" may belong to another edition of this title.
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: New. 494 pp., hardcover, new. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1342215
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. Condition: Gut. 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
Quantity: 1 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA75805217709395
Quantity: 1 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521770934
Seller: Books Puddle, Woodside, NY, U.S.A.
Condition: New. Print on Demand pp. 494. Seller Inventory # 26260835
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 494 Illus. Seller Inventory # 7619900
Quantity: 4 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Explores the link between discrepancy theory and randomized algorithms. Num Pages: 494 pages, 160 b/w illus. BIC Classification: PBC; PBH; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 228 x 152 x 32. Weight in Grams: 780. . 2000. hardcover. . . . . Seller Inventory # V9780521770934
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 494. Seller Inventory # 18260841
Quantity: 4 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521770934_new
Quantity: Over 20 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal to students and researchers in computer science, operations research, pure and applied mathematics, and engineering. Seller Inventory # LU-9780521770934
Quantity: 1 available