SC
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space
en-US/ˌɛsˌsi/
complexity class of problems solvable by a deterministic Turing machine in polynomial time and polylogarithmic space