e/ZPL (complexity)

Information
has gloss	eng: In complexity theory, ZPL (Zero-error Probabilistic Logarithmic space) is the set of problems solvable by a probabilistic Turing machine which always yields the correct answer and uses logarithmic space on average. Probabilistic algorithms that always give the correct answer are called Las Vegas algorithms.
lexicalization	eng: ZPL
instance of	c/Probabilistic complexity classes