Explore relationships

RP (complexity)

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 sizeIf the correct answer is NO, it always returns NOIf the correct answer is YES, then it returns YES with probability at least 1/2 (otherwise, it returns NO).In other words, the algorithm is allowed to flip a truly random coin while it is running.

Use + to expand a branch. Click a topic name to open its summary.