Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01088851n
Noun Named Entity
FR
BPL
EN
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. Wikipedia
English:
complexity
Relations
Sources
IS A
classe de complexité
HAS PART
RL
PART OF
SC
L/poly
PL
Wikidata
FR
BPL

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License