0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Combinatorics & graph theory

Buy Now

Probabilistic Methods for Algorithmic Discrete Mathematics (Paperback, Softcover reprint of hardcover 1st ed. 1998) Loot Price: R2,804
Discovery Miles 28 040
Probabilistic Methods for Algorithmic Discrete Mathematics (Paperback, Softcover reprint of hardcover 1st ed. 1998): Michel...

Probabilistic Methods for Algorithmic Discrete Mathematics (Paperback, Softcover reprint of hardcover 1st ed. 1998)

Michel Habib, Colin McDiarmid, Jorge Ramirez-Alfonsin, Bruce Reed

Series: Algorithms and Combinatorics, 16

 (sign in to rate)
Loot Price R2,804 Discovery Miles 28 040 | Repayment Terms: R263 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Algorithms and Combinatorics, 16
Release date: August 2010
First published: 1998
Editors: Michel Habib • Colin McDiarmid • Jorge Ramirez-Alfonsin • Bruce Reed
Dimensions: 235 x 155 x 16mm (L x W x T)
Format: Paperback
Pages: 325
Edition: Softcover reprint of hardcover 1st ed. 1998
ISBN-13: 978-3-642-08426-3
Categories: Books > Science & Mathematics > Mathematics > Probability & statistics
Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Applications of computing > General
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
LSN: 3-642-08426-5
Barcode: 9783642084263

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners