Content deleted Content added
Upper bounded -> bounded from above |
m →Derandomization: grammatical number agreement correction "an algorithm that run" changed to "an algorithm that runs" |
||
Line 145:
==Derandomization==
Randomness can be viewed as a resource, like space and time. Derandomization is then the process of ''removing'' randomness (or using as little of it as possible). It is not currently known if all algorithms can be derandomized without significantly increasing their running time. For instance, in [[analysis of algorithms|computational complexity]], it is unknown whether [[P (complexity)|P]] = [[Bounded-error probabilistic polynomial|BPP]], i.e., we do not know whether we can take an arbitrary randomized algorithm that
There are specific methods that can be employed to derandomize particular randomized algorithms:
| |||