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
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).