SL (complexity)¶
The complexity class Symmetric Logspace, equivalently problems log-space reducible to undirected s–t connectivity and, by Reingold's theorem, equal to deterministic logspace L.
Core Idea¶
SL is the class captured by symmetric logspace computation and complete undirected graph connectivity. Machine configurations form an undirected reachability graph; deterministic exploration using logarithmic space establishes the class's equality with L. 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.
The load-bearing residual is not the broad topic of computational complexity. It is historical symmetric-reachability characterization of deterministic logspace. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that space accounting and reduction type follow the standard model and the input is read-only fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.
Scope of Application¶
SL (complexity) belongs to computational complexity and is useful where the analyst can specify a decision problem, symmetric nondeterministic Turing machine or undirected reachability instance, logarithmic work space, log-space reductions, complexity class SL and containment or equality proofs, then evaluate space accounting and reduction type follow the standard model and the input is read-only. The scope is broad within that domain but bounded by the need for space accounting and reduction type follow the standard model and the input is read-only. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
Clarity¶
The abstraction clarifies a crowded vocabulary by making space accounting and reduction type follow the standard model and the input is read-only the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name SL (complexity) can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.
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 SL (complexity). SL (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: a decision problem, symmetric nondeterministic Turing machine or undirected reachability instance, logarithmic work space, log-space reductions, complexity class SL and containment or equality proofs. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express space accounting and reduction type follow the standard model and the input is read-only independently of one notation or implementation.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of computational complexity because they reuse a decision problem, symmetric nondeterministic Turing machine or undirected reachability instance, logarithmic work space, log-space reductions, complexity class SL and containment or equality proofs, Machine configurations form an undirected reachability graph; deterministic exploration using logarithmic space establishes the class's equality with L., and type the carrier, state every parameter and convention in the definition, test that space accounting and reduction type follow the standard model and the input is read-only, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction SL (complexity) Domain-specific
Parents (1) — more general patterns this builds on
-
SL (complexity) is a kind of Classification Prime
The proposed strict upward parent is
prime:classification.
Hierarchy path (1) — routes to 1 parentless root
- SL (complexity) → Classification
Neighborhood in Abstraction Space¶
SL (complexity) sits in a crowded region of the domain-specific corpus (18th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Space Complexity & Hierarchies (11 abstractions)
Nearest neighbors
- PolyL — 0.93
- SC (complexity) — 0.93
- NSPACE — 0.93
- PSPACE — 0.91
- Constructible function — 0.91
Computed from structural-signature embeddings · 2026-09-08