SC (Q7389363)
Jump to navigation
Jump to search
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space
- DTISP(poly, polylog)
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SC |
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space |
|
Statements
Identifiers
Sitelinks
Wikipedia(6 entries)
- cawiki SC (Complexitat)
- enwiki SC (complexity)
- eswiki SC (clase de complejidad)
- frwiki SC (complexité)
- ptwiki SC (complexidade)
- zhwiki SC (複雜度)