RL (complexity)

Randomized Logarithmic-space (RL),^[1] sometimes called RLP (Randomized Logarithmic-space Polynomial-time),^[2] is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error. It is named in analogy with RP, which is similar but has no logarithmic space restriction.