Construct · 1 fields · 1 citations

average-case completeness: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computational complexity

a theory in which problems paired with input distributions are compared by reductions, with some shown complete for being hard on average.

In computational complexity, average-case completeness refers to a theory in which problems paired with input distributions are compared by reductions, with some shown complete for being hard on average. This meaning comes from Levin (1986) in SIAM Journal on Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how average-case completeness sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

being3 fields · 3 citationsjingle · one word, three constructs completeness3 fields · 4 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs

References

Levin, L. A. (1986). Average Case Complete Problems. SIAM Journal on Computing, 15(1), 285-286. https://doi.org/10.1137/0215020

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct