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
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