Also known as DTISP(poly, polylog), SC complexity class
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space
Connections
digital object identifier
Entity
Turing machine
Entity
Q118398
Entity
theoretical computer science
Entity
depth-first search
Entity
big O notation
Entity
computational complexity theory
Entity
Q22908627
Entity
Stephen Cook
Entity
NP-complete
Entity
NP
Entity
P
Entity
regular language
Entity
complexity class
Entity
NP-hard
Entity
context-free language
Entity
randomized algorithm
Entity
PSPACE
Entity
NL
Entity
probabilistic Turing machine
Entity