Reduction (complexity)

An algorithmic transformation from instances of one computational problem to another that preserves answers and is efficient enough to transfer solvability or hardness results.

Version

v1 · 2026-09-08 · History

Domain-specific #

6438

Origin domain

computational complexity

Subdomain

problem reductions

Core Idea

A reduction shows that solving a target problem under a specified efficient transformation suffices to solve a source problem. The transformation converts source instances or queries into target instances, invokes a target solver if allowed, and reconstructs the source answer within the reduction's resource budget. 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 formal bridge for ordering computational difficulty and proving completeness.

Scope of Application

Reduction (complexity) belongs to computational complexity and is useful where the analyst can specify a source problem A and target problem B, instance mapping or oracle procedure, answer-preservation condition, resource bound, reduction type and complexity classes, then evaluate yes and no answers or function values are preserved under the declared many-one, Turing, parsimonious or approximation-reduction convention. The scope is broad within that domain but bounded by the need for yes and no answers or function values are preserved under the declared many-one, Turing, parsimonious or approximation-reduction convention. 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 yes and no answers or function values are preserved under the declared many-one, Turing, parsimonious or approximation-reduction convention 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 Reduction (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 Reduction (complexity). Reduction (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

1. Identify the carrier. State what the elements, states, objects, or observations are: a source problem A and target problem B, instance mapping or oracle procedure, answer-preservation condition, resource bound, reduction type and complexity classes. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express yes and no answers or function values are preserved under the declared many-one, Turing, parsimonious or approximation-reduction convention independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of computational complexity because they reuse a source problem A and target problem B, instance mapping or oracle procedure, answer-preservation condition, resource bound, reduction type and complexity classes, The transformation converts source instances or queries into target instances, invokes a target solver if allowed, and reconstructs the source answer within the reduction's resource budget., and type the carrier, state every parameter and convention in the definition, test that yes and no answers or function values are preserved under the declared many-one, Turing, parsimonious or approximation-reduction convention, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Reduction (complexity) Domain-specific

Parents (1) — more general patterns this builds on

• Reduction (complexity) is a kind of Transformation Prime

  The proposed strict upward parent is prime:transformation.

Hierarchy path (1) — routes to 1 parentless root

• Reduction (complexity) → Transformation → Function (Mapping)

Neighborhood in Abstraction Space

Reduction (complexity) sits in a crowded region of the domain-specific corpus (35^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Algorithms, Proofs & Computational Decisions (25 abstractions)

Nearest neighbors

• Parsimonious reduction — 0.92
• Computational problem — 0.90
• Computational complexity theory — 0.90
• Polynomial hierarchy — 0.90
• Constructible function — 0.89

Computed from structural-signature embeddings · 2026-09-08