Overview
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.
Full Product Details
Author: J. Hromkovic ,
I. Zámecniková
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: 1st ed. Softcover of orig. ed. 2005
Dimensions:
Width: 15.50cm
, Height: 1.50cm
, Length: 23.50cm
Weight: 0.454kg
ISBN: 9783642063008
ISBN 10: 3642063004
Pages: 277
Publication Date: 21 October 2010
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: Out of print, replaced by POD
We will order this item for you from a manufatured on demand supplier.
Reviews
From the reviews: The book gives an introduction to (design and analysis of) randomized algorithms. It is a self-contained textbook primarily for students. ! The proofs are precise and contain all details. This makes the book perfect for self-study. ! A student ! will be happy to find everything defined precisely and explained in detail. (Benjamin Doerr, Zentralblatt MATH, Vol. 1083, 2006) Theory of Computing community (especially those who work on Algorithm Design) is well acquainted with the concept of Randomization. ! this book still gives a fresh and interesting point of view to Randomization and Randomized Algorithms. ! This is a very good to excellent textbook on the Design and Analysis of Randomized Algorithms. Its unique ! feature is that it explicitly isolates and promotes the most important design techniques; this is really a great experience for the incoming theorist to specialize on Randomized Algorithms. (Marios Mavronicolas, SIGACT News, Vol. 40 (2), 2009)
From the reviews: The book gives an introduction to (design and analysis of) randomized algorithms. It is a self-contained textbook primarily for students. ! The proofs are precise and contain all details. This makes the book perfect for self-study. ! A student ! will be happy to find everything defined precisely and explained in detail. (Benjamin Doerr, Zentralblatt MATH, Vol. 1083, 2006) Theory of Computing community (especially those who work on Algorithm Design) is well acquainted with the concept of Randomization. ! this book still gives a fresh and interesting point of view to Randomization and Randomized Algorithms. ! This is a very good to excellent textbook on the Design and Analysis of Randomized Algorithms. Its unique ! feature is that it explicitly isolates and promotes the most important design techniques; this is really a great experience for the incoming theorist to specialize on Randomized Algorithms. (Marios Mavronicolas, SIGACT News, Vol. 40 (2), 2009)
