Design and Analysis of Randomized Algori
β Juraj HromkoviΔ
π Library
π
2005
π Springer
π English
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 ye