3.Next

In computational complexity theory, randomized polynomial time (RP) is the complexity class of decision problems for which a probabilistic Turing machine exists with these properties:

* It always runs in polynomial time in the input size
* If the correct answer is NO, it always returns NO
* If the correct answer is YES,

3.Next