You might also like

More about Design and Analysis of Randomized Algorithms

• Book details
• Synopsis
• Trending among others

You get 147 loyalty points

Book synopsis

Systematically teaches key paradigmic algorithm design methods§Provides a deep insight into randomizationRandomness 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.

Book details

Book category Books in English Computing & information technology Computer programming / software development Algorithms & data structures

• Full title: Design and Analysis of Randomized Algorithms
• Author: Juraj Hromkovic, I. Zámecniková
• Language: English
• Binding: Paperback
• Number of pages: 292
• EAN: 9783642063008
• ISBN: 3642063004
• ID: 02108287
• Publisher: Springer, Berlin
• Weight: 446 g
• Dimensions: 235 × 155 × 16 mm
• Date of publishing: 21. October 2010

Trending among others

---

---

---