Average-case complexity

The expected computational resource usage of an algorithm or problem under an explicitly specified probability distribution over inputs of each size.

Version

v1 · 2026-09-08 · History

Domain-specific #

3376

Origin domain

computational complexity

Subdomain

distributional complexity

Core Idea

Average-case complexity measures expected resource cost over a declared distribution of inputs, usually conditioned on input size. Each input's cost is weighted by its occurrence probability; asymptotic analysis tracks the resulting expectation and, in stronger treatments, tail behavior across sizes. 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 distribution-relative expected complexity distinct from worst-case upper bounds. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

Scope of Application

Average-case complexity belongs to computational complexity and is useful where the analyst can specify an algorithm or distributional problem, input length, a probability distribution over inputs, time or space cost, expectation and asymptotic bounds, then evaluate the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples. The scope is broad within that domain but bounded by the need for the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples. 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 the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples 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 Average-case 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 Average-case complexity. Average-case 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: an algorithm or distributional problem, input length, a probability distribution over inputs, time or space cost, expectation and asymptotic bounds. Reject examples whose alleged carrier belongs to a different problem. 2. Lock the constitutive rule. Express the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of computational complexity because they reuse an algorithm or distributional problem, input length, a probability distribution over inputs, time or space cost, expectation and asymptotic bounds, Each input's cost is weighted by its occurrence probability; asymptotic analysis tracks the resulting expectation and, in stronger treatments, tail behavior across sizes., and type the carrier, state every parameter and convention in the definition, test that the input ensemble and resource model are fixed and the reported average is probability-weighted rather than an unqualified mean over convenient examples, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Average-case complexity Domain-specific

Parents (1) — more general patterns this builds on

• Average-case complexity is a kind of Measurement Prime

  The proposed strict upward parent is prime:measurement.

Hierarchy path (1) — routes to 1 parentless root

• Average-case complexity → Measurement

Neighborhood in Abstraction Space

Average-case complexity sits in a moderately populated region (41^st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Machine Learning & Statistical Estimation (24 abstractions)

Nearest neighbors

• Computational complexity theory — 0.90
• Fisher information — 0.89
• Exchangeable random variables — 0.89
• Weight function — 0.89
• Merge algorithm — 0.89

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