Every randomized algorithm can be simulated by a deterministic algorithm, at the expense of an exponential increase in running time. Derandomization is about converting randomized algorithms into efficient deterministic algorithms.
About
Stats
|
created |
11 years, 10 months ago |
|
viewed |
44 times |
|
editors |
0 |
