Stock image for illustration purposes only - book cover, edition or condition may vary.
Probabilistic Methods for Algorithmic Discrete Mathematics
. Ed(S): Habib, Michel; McDiarmid, Colin (University Of Oxford, Uk); Ramirez Alfonsin, Jorge L.; Reed, Bruce
€ 128.79
FREE Delivery in Ireland
Description for Probabilistic Methods for Algorithmic Discrete Mathematics
Hardback. This text gives an accessible account of modern probabilistic methods for analyzing combinatorial structures and algorithms. It should be a useful guide for graduate students and researchers. Editor(s): Habib, Michel; McDiarmid, Colin (University of Oxford, UK); Ramirez Alfonsin, Jorge L.; Reed, Bruce. Series: Algorithms and Combinatorics. Num Pages: 342 pages, biography. BIC Classification: PBV. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 20. Weight in Grams: 664.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
1998
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
342
Condition
New
Series
Algorithms and Combinatorics
Number of Pages
325
Place of Publication
Berlin, Germany
ISBN
9783540646228
SKU
V9783540646228
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for Probabilistic Methods for Algorithmic Discrete Mathematics