| |
| |
RLP - Wikipedia, the free encyclopedia |
 | | InsertformulaheretsIn computational complexity theory, RLP is the complexity class of problems solvable in logarithmithic space and polynomial time with probabilistic Turing machines that never accept incorrectly but are allowed to reject incorrectly less than 1/3 of the time; this is called one-sided error. |
 | | RLP is contained in both RP, which is the same but has no space restriction, and RL, which is the same but has no time restriction. |
 | | RLP also contains L, the problems solvable by deterministic Turing machines in log space, since its definition is just more general, and is contained in NL, the problems solvable by nondeterministic Turing machines in log space, because NL=RL. |
| en.wikipedia.org /wiki/RLP (254 words) |
|