Construct · 1 fields · 1 citations

worst-case to average-case reduction: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
worst-case toaverage-case reduction1 CONSTRUCTWorst-case toAJTAI · COMPUTATIONAL

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 reduction showing that solving random instances of a problem would solve its hardest instances, first given for lattice problems.

In computational complexity, worst-case to average-case reduction refers to a reduction showing that solving random instances of a problem would solve its hardest instances, first given for lattice problems. This meaning comes from Ajtai (1996) in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96.[1]

Unit
Recovery means
Measured by

Next

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

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

Open in ColliderExport BibTeXReport this entry

Nearby constructs

short integer solution problem1 fields · 1 citationsanchor · a standalone constructcomplexity4 fields · 7 citationsjingle · one word, four constructslattice4 fields · 4 citationsjingle · one word, four constructs

References

  1. Ajtai, M. (1996). Generating hard instances of lattice problems (extended abstract). Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. https://doi.org/10.1145/237814.237838

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