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 ...
Read More
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.
Read Less
Add this copy of Design and Analysis of Randomized Algorithms: to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
10679090676
Shipping Options:
Standard Shipping: $4.99
Trackable Expedited: $9.99
Two Day Air: $29.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Zámecniková, I. New. Print on demand Texts in Theoretical Computer Science. An EATCS Series . XII, 277 p. Intended for professional and scholarly audience.
Add this copy of Design and Analysis of Randomized Algorithms: to cart. $65.75, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2005 by Springer.
