BPL (complexity)
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.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
BPL (complexity)
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.
has abstract
In computational complexity th ...... logarithmic space restriction.
@en
Na teoria da complexidade comp ...... DSPACE(log3/2 n) e em L/poly.
@pt
在計算複雜度理論領域內，BPL（有限錯誤機率對數空間，Bou ...... 多項式對數空間，一個決定型機器可以模擬對數空間的機率演算法。
@zh
Wikipage page ID
18,449,708
page length (characters) of wiki page
Wikipage revision ID
1,015,706,092
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In computational complexity th ...... logarithmic space restriction.
@en
Na teoria da complexidade comp ...... DSPACE(log3/2 n) e em L/poly.
@pt
在計算複雜度理論領域內，BPL（有限錯誤機率對數空間，Bou ...... L可能需要花費很多次的計算來降低錯誤的機率，因此比較不實用。
@zh
label
BPL (complexidade)
@pt
BPL (complexity)
@en
BPL (複雜度)
@zh