Information | |
---|---|
has gloss | eng: In computational complexity theory, BPL (Bounded-error Probabilistic Logarithmic-space), sometimes called BPLP (Bounded-error Probabilistic Logarithmic-space Polynomial-time), is the complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with two-sided error. It is named in analogy with BPP, which is similar but has no logarithmic space restriction. |
lexicalization | eng: BPL |
instance of | c/Probabilistic complexity classes |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint