SC, or "Small-Chain," is a complexity class in the realm of computational complexity theory. However, the abbreviation SC is more commonly associated with "slightly super-polynomial" and refers to problems that can be solved by non-deterministic Turing machines in polylogarithmic space and polynomial time, specifically with logarithmic depth of the computation. In broader terms, complexity classes categorize problems based on the resources required for their solutions (such as time and space).
New to topics? Read the docs here!