Design and Analysis of Randomized Algorithms

Lieferzeit: Lieferbar innerhalb 14 Tagen

50,28 €

inkl. 7 % MwSt. zzgl. Versandkosten

Introduction to Design Paradigms, Texts in Theoretical Computer Science. An EATCS Series

ISBN: 3642063004
ISBN 13: 9783642063008
Autor: Hromkovic, J
Verlag: Springer Verlag GmbH
Illustrator: I Zámecniková
Umfang: xii, 277 S.
Erscheinungsdatum: 21.10.2010
Auflage: 1/2005
Format: 1.8 x 23.5 x 15.5
Gewicht: 452 g
Produktform: Kartoniert
Einband: KT

Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities. Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader’s intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.

Artikelnummer: 1511274 Kategorie:

Beschreibung

InhaltsangabeFundamentals.- Foiling the Adversary.- Fingerprinting.- Success Amplification and Random Sampling.- Abundance of Witnesses.- Optimization and Random Rounding.

Inhaltsverzeichnis

From the contents: Introduction.- Fundamentals.- Foiling the Adversary.- Fingerprinting.- Success Amplification and Random Sampling.- Abundance of Witnesses.- Optimization and Random Rounding.- Appendix: Fundamentals of Mathematics.- References. Index.

Das könnte Ihnen auch gefallen …