RL (Q579152)
Jump to navigation
Jump to search
complexity class of computational problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error
- RPL
- randomized logarithmic-space
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | RL |
complexity class of computational problems solvable in logarithmic space and polynomial time with probabilistic Turing machines with one-sided error |
|
Statements
Identifiers
Sitelinks
Wikipedia(5 entries)
- cawiki RL (Complexitat)
- dewiki RL (Komplexitätsklasse)
- enwiki RL (complexity)
- ptwiki RL (complexidade)
- zhwiki RL (複雜度)