Design and Analysis of Randomized Algorithms

J. Hromkovic

ISBN 10: 3540239499 / ISBN 13: 9783540239499

Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer, 2005

Beschreibung

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 277 pp. Englisch.

Bestandsnummer des Verkäufers 9783540239499

Bibliografische Details

• Titel: Design and Analysis of Randomized Algorithms
• Verlag: Springer, Berlin, Springer Berlin Heidelberg, Springer
• Veröffentlichungsdatum: 2005
• Sprache: Englisch
• ISBN-10: 3540239499
• ISBN-13: 9783540239499
• Bindung: Buch
• Illustrator: Zámecniková, I.
• Zustand: Neu

Über diesen Titel

Inhaltsangabe

Systematically teaches key paradigmic algorithm design methods

Provides a deep insight into randomization

Von der hinteren Coverseite

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.