Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00311165n
Noun Named Entity
Categories: Probabilistic complexity classes
EN
RL  Complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines  randomized logarithmic-space  Randomized Logarithmic-space Polynomial-time  RLP
EN
Randomized Logarithmic-space, sometimes called RLP, is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
Randomized Logarithmic-space, sometimes called RLP, is the complexity class of computational complexity theory problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error. Wikipedia
A complexity class of mathematical problems Wikipedia Disambiguation
Complexity class of computational problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error Wikidata
IS A
complexity class
HAS PART
L
PART OF
NL
BPL
Wikipedia
EN
RL (complexity)
Wikidata
EN
RL
Wikipedia Redirections
EN
Complexity class of problems solvable in logarithmic space and polynomial time with probabilistic Turing machines, Randomized Logarithmic-space, Randomized Logarithmic-space Polynomial-time, RLP (complexity)
Wikidata Alias
EN
randomized logarithmic-space, RPL

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