RL (complexity)
In complexity theory RL is the class of decision problems that are solvable by a probabilistic Turing machine in logarithmic space. The answer must be correct in at least half of the cases.
- Complexity class
RL (complexity)In complexity theory RL is the class of decision problems that are solvable by a probabilistic Turing machine in logarithmic space. The answer must be correct in at least half of the cases.
|
|