polyL (Q7226108)
Jump to navigation
Jump to search
complexity class of decision problems that can be solved on a deterministic Turing machine by an algorithm whose space complexity is bounded by a polylogarithmic function in the size of the input
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | polyL |
complexity class of decision problems that can be solved on a deterministic Turing machine by an algorithm whose space complexity is bounded by a polylogarithmic function in the size of the input |
Statements
Identifiers
Sitelinks
Wikipedia(4 entries)
- cawiki PolyL (Complexitat)
- enwiki PolyL
- eswiki PolyL
- zhwiki PolyL