9780521770934 - The Discrepancy Method: Randomness and Complexity von Chazelle, Bernard; Chazelle, B. (7 Ergebnisse)

Zustand: New. *Price HAS BEEN REDUCED by 10% until Monday, July 13 (SALE Item)* 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.

Hardcover. 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.

Zustand: New. pp. 494 Illus.

Zustand: New. In.

Gebunden. Zustand: New. The discrepancy method is the most fruitful line of attack on the pivotal question: what is the computational power of random bits? This book includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, derandomization,.

Zustand: 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. . . . . Books ship from the US and Ireland.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.