SC (complexity)¶
The complexity class of decision problems solvable by one deterministic algorithm using polynomial time and polylogarithmic space.
Core Idea¶
The same machine must meet both bounds, so SC is not definitionally P intersect PolyL, exponent conventions are fixed constants and several containments remain open. A deterministic Turing machine decides every input while bounding its steps polynomially and its work tape by a fixed power of logarithmic input length, enforcing simultaneous resource efficiency. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
SC (complexity) belongs to computational complexity and is useful where the analyst can specify the typed computational complexity carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems are explicit. The scope is broad within that domain but bounded by the need for the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to SC (complexity). SC (complexity) compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed computational complexity carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems are explicit independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of computational complexity because they reuse the typed computational complexity carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, A deterministic Turing machine decides every input while bounding its steps polynomially and its work tape by a fixed power of logarithmic input length, enforcing simultaneous resource efficiency., and type the carrier, state every parameter and convention in the definition, test that the decision problem and input length, deterministic machine model, polynomial time bound, polylogarithmic space bound and fixed exponents, same-algorithm requirement, DTISP notation, containments with L NC P and PolyL and named complete or open problems are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction SC (complexity) Domain-specific
Parents (1) — more general patterns this builds on
-
SC (complexity) is a kind of Constraint Prime
The proposed strict upward parent is
prime:constraint.
Hierarchy path (1) — routes to 1 parentless root
- SC (complexity) → Constraint
Neighborhood in Abstraction Space¶
SC (complexity) sits in a crowded region of the domain-specific corpus (1st percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Computational Complexity Classes & Reductions (22 abstractions)
Nearest neighbors
- Constructible function — 0.96
- PSPACE — 0.95
- Parity P — 0.95
- PolyL — 0.95
- AC0 — 0.94
Computed from structural-signature embeddings · 2026-09-08