BPL
complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with two-sided error
Press Enter · cited answer in seconds
0 sources
BPL
Summary
BPL is a complexity class[1]. BPL draws 12 Wikipedia views per month (complexity_class category, ranking #39 of 61).[2]
Key Facts
- BPL's instance of is recorded as complexity class[3].
- BPL's part of is recorded as PL[4].
- BPL's part of is recorded as SC[5].
- BPL's part of is recorded as L/poly[6].
- BPL's has part is recorded as RL[7].
- BPL's Freebase ID is recorded as /m/04f2w27[8].
Why It Matters
BPL draws 12 Wikipedia views per month (complexity_class category, ranking #39 of 61).[2]