e/RL (complexity)

Information
has gloss	eng: In computational complexity theory, RL (Randomized Logarithmic-space), sometimes called RLP (Randomized Logarithmic-space Polynomial-time), is the complexity class of 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.
lexicalization	eng: RL
instance of	c/Probabilistic complexity classes