e/SC (complexity)

Information
has gloss	eng: In computational complexity theory, SC (Steve's Class, named after Stephen Cook) is the complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space (that is, O(logk n) space for some constant k). It may also be called DTISP(poly, polylog), where DTISP stands for deterministic time and space.
lexicalization	eng: SC
instance of	e/Complexity class