Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms by Juraj HromkoviČ
English | PDF(True) | 2005 | 280 Pages | ISBN : 3540239499 | 2.63 MB
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.