Bernard chazelle (40 Ergebnisse)

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Trade Paperback. Zustand: Good. No Dust Jacket. First Paperback Edition. An ex-library copy of this 475-page paperback. The usual ex-libris markings. The binding is sound, the text is clean/unmarked, and there is little wear to the covers. Book.

Soft cover. Zustand: Good. No jacket. Cover is shelf worn and slightly rubbed, but otherwise cover is in good condition. Binding is tight and inside is clean and unmarked.

XVII/463 S./pp., Originalpappband (publisher's cardboard covers), Bibliotheksexemplar in sehr gutem Zustand / exlibrary in good condition (Stempel auf Titel / title stamped, Rückenschildchen / lettering pannel to the spine, Block sehr gut / contents fine, keine Unterstreichungen oder Anstreichungen / no underlining or remarks, in Folie eingeschlagen / wrapped up in foil), Sprache: englisch.…

Hardcover. Zustand: 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.…

Paperback. Zustand: New. Print on Demand. This book presents an algorithm for generalized point location and discusses its applications to several optimization problems. The generalized point location problem involves finding the location of a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. The author shows that Collins' classical quantifier elimination procedure contains most of the ingredients for an efficient point location algorithm in higher -dimensional space. This leads to a polynomial -size data structure which allows one to locate a point among a collection of real algebraic varieties of constant maximum degree in logarithmic time. This result has theoretical hearings on a number of optimization problems posed in the literature. It also gives a method for solving multidimensional searching problem in polynomial space and logarithmic query time. The author has acknowledged the support of the National Science Foundation and the Office of Naval Research and has expressed their gratitude towards various other organizations and individuals. Overall, this book is a valuable resource for researchers and students working in the field of computational geometry and optimization. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.…

Cloth. Zustand: Very Good. Zustand des Schutzumschlags: No d/j as Published. Type: Book Plain label inside cover.

Zustand: New.

Zustand: New.

Paperback. Zustand: New. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New. Explores the link between discrepancy theory and randomized algorithms. Num Pages: 494 pages, 160 b/w illus. BIC Classification: PBH; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 230 x 151 x 31. Weight in Grams: 794. . 1998. Revised ed. paperback. . . . . …

Zustand: New. In English.

Zustand: As New. Unread book in perfect condition.

kartoniert kartoniert. Zustand: Sehr gut. 475 Seiten, mit Abbildungen, Zust: Gutes Exemplar. Schneller Versand und persönlicher Service - jedes Buch händisch geprüft und beschrieben - aus unserem Familienbetrieb seit über 25 Jahren. Eine Rechnung mit ausgewiesener Mehrwertsteuer liegt jeder unserer Lieferungen bei. Wir versenden mit der deutschen Post. Sprache: Englisch Gewicht in Gramm: 676.…

Zustand: New. Explores the link between discrepancy theory and randomized algorithms. Num Pages: 494 pages, 160 b/w illus. BIC Classification: PBH; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 230 x 151 x 31. Weight in Grams: 794. . 1998. Revised ed. paperback. . . . . Books ship from the US and Ireland. …

Taschenbuch. 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.…

Hardcover. Zustand: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Zustand: New.

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

Zustand: New. In English.

Hardback. Zustand: 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.…

Hardcover. Zustand: Brand New. 1st edition. 463 pages. 9.50x6.50x1.25 inches. In Stock.

Zustand: gut. 2000. The Discrepancy Method: Randomness and Complexity In englischer Sprache. pages.

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

Hardback. Zustand: 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.…