BPL (complexity)
id:
bpl-complexity-252-6006541
title:
BPL (complexity)
text:
In computational complexity theory, BPL, sometimes called BPLP, 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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/BPL_(complexity)
date created:
date modified:
2022-06-17T23:47:39Z
main entity:
{"identifier":"Q4836264","url":"https://www.wikidata.org/entity/Q4836264"}
image:
fields total:
13
integrity:
13