RL (complexity)
id:
rl-complexity-246-8312320
title:
RL (complexity)
text:
Randomized Logarithmic-space (RL), 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. It is named in analogy with RP, which is similar but has no logarithmic space restriction.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/RL_(complexity)
date created:
date modified:
2018-12-13T08:07:53Z
main entity:
{"identifier":"Q579152","url":"https://www.wikidata.org/entity/Q579152"}
image:
fields total:
13
integrity:
13