Assertion: randomized algorithm | /r/CapableOf | run in polynomial time
Facets:
value: with a small error probability
type: OTHER
Source sentences:
text: For instance, in computational complexity, it is unknown whether P = BPP, i.e., we do not know whether we can take an arbitrary randomized algorithm that runs in polynomial time with a small error probability and derandomize it to run in polynomial time without using randomness.