Probabilistic Methods Algorithmic Discrete (26 results)
- Hardcover
Seller: Romtrade Corp., STERLING HEIGHTS, U.S.A.Romtrade Corp.
Contact seller5-star sellerCondition: New
US$ 85.46
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
- Hardcover
Seller: Basi6 International, Irving, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
US$ 85.46
Free ShippingShips within U.S.A.Quantity: 1 available
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
- Hardcover
Seller: Anybook.com, Lincoln, United KingdomAnybook.com
Contact seller5-star sellerCondition: Used - Good
US$ 75.54
US$ 18.30 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Good. Volume 16. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:9783540646228.
- Hardcover
Seller: Phatpocket Limited, Waltham Abbey, United KingdomPhatpocket Limited
Contact seller5-star sellerCondition: Used - Good
US$ 80.85
US$ 14.32 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
- Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, GermanyAntiquariat Bookfarm
Contact seller5-star sellerCondition: Used
US$ 61.50
US$ 46.64 shippingShips from Germany to U.S.A.Quantity: 1 available
Hardcover. 323 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04504 9783540646228 Sprache: Englisch Gewicht in Gramm: 550.
- Hardcover
Seller: Books Puddle, New York, U.S.A.Books Puddle
Contact seller4-star sellerCondition: Used
US$ 106.87
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: Used. pp. 348.
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: Used
US$ 105.52
US$ 8.75 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: Used. pp. 348 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
- Hardcover
Seller: Biblios, frankfurt am main, GermanyBiblios
Contact seller4-star sellerCondition: Used
US$ 113.95
US$ 11.60 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Used. pp. 348.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 134.27
US$ 16.12 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 134.27
US$ 16.12 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, Michel|McDiarmid, Colin|Ramirez-Alfonsin, Jorge|Reed, Bruce
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 110.83
US$ 57.13 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, Michel|McDiarmid, Colin|Ramirez-Alfonsin, Jorge|Reed, Bruce
- Hardcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 110.83
US$ 57.13 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
Probabilistic Methods for Algorithmic Discrete Mathematics (Algorithms and Combinatorics, 16)
Habib, Michel [Editor]; McDiarmid, Colin [Editor]; Ramirez-Alfonsin, Jorge [Editor]; Reed, Bruce [Editor];
- Hardcover
Seller: BennettBooksLtd, Los Angeles, U.S.A.BennettBooksLtd
Contact seller5-star sellerCondition: New
US$ 158.58
US$ 6.95 shippingShips within U.S.A.Quantity: 1 available
hardcover. Condition: New. In shrink wrap. Looks like an interesting title.
- Softcover
Seller: Books Puddle, New York, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 162.42
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. pp. 344.
- Hardcover
Seller: Buchpark, Trebbin, GermanyBuchpark
Contact seller5-star sellerCondition: Used - Fine
US$ 62.31
US$ 122.44 shippingShips from Germany to U.S.A.Quantity: 2 available
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 348 | Sprache: Englisch | Produktart: Bücher | Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, n…othing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 114.28
US$ 81.63 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Probabilistic Methods for Algorithmic Discrete Mathematics | Michel Habib (u. a.) | Taschenbuch | xvii | Englisch | 2010 | Springer | EAN 9783642084263 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter:…preigu.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 73.05 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be… further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.
- Hardcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 73.98 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing could be furthe…r from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.
- Hardcover
Seller: Mispah books, Redhill, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 177.40
US$ 33.64 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Hardcover. Condition: Like New. Like NewLIKE NEW. book.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, ItalyBrook Bookstore On Demand
Contact seller3-star sellerCondition: New
US$ 103.59
US$ 7.93 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 26.82 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing… could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o. 348 pp. Englisch.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 26.82 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least,…nothing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o. 348 pp. Englisch.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 167.90
US$ 8.75 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand pp. 344 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 180.20
US$ 11.60 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND pp. 344.
- Hardcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 69.97 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, nothing cou…ld be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 348 pp. Englisch.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 128.51
US$ 69.97 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Leave nothing to chance. This cliche embodies the common belief that ran domness has no place in carefully planned methodologies, every step should be spelled out, each i dotted and each t crossed. In discrete mathematics at least, noth…ing could be further from the truth. Introducing random choices into algorithms can improve their performance. The application of proba bilistic tools has led to the resolution of combinatorial problems which had resisted attack for decades. The chapters in this volume explore and celebrate this fact. Our intention was to bring together, for the first time, accessible discus sions of the disparate ways in which probabilistic ideas are enriching discrete mathematics. These discussions are aimed at mathematicians with a good combinatorial background but require only a passing acquaintance with the basic definitions in probability (e.g. expected value, conditional probability). A reader who already has a firm grasp on the area will be interested in the original research, novel syntheses, and discussions of ongoing developments scattered throughout the book. Some of the most convincing demonstrations of the power of these tech niques are randomized algorithms for estimating quantities which are hard to compute exactly. One example is the randomized algorithm of Dyer, Frieze and Kannan for estimating the volume of a polyhedron. To illustrate these techniques, we consider a simple related problem. Suppose S is some region of the unit square defined by a system of polynomial inequalities: Pi (x. y) ~ o.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 348 pp. Englisch.
