Construct · 1 fields · 1 citations

smoothed analysis: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
smoothedanalysis1 CONSTRUCTSmoothed analysisSPIELMAN · ALGORITHMS

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

Algorithms

judging an algorithm by its worst expected cost under small random perturbations of inputs, explaining why some worst-case slow methods run fast in practice.

In algorithms, smoothed analysis refers to judging an algorithm by its worst expected cost under small random perturbations of inputs, explaining why some worst-case slow methods run fast in practice. This meaning comes from Spielman (2004) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Next

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

See how smoothed analysis 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

cost4 fields · 4 citationsjingle · one word, four constructspractice3 fields · 4 citationsjingle · one word, three constructs

References

  1. Spielman, D. A., & Teng, S. (2004). Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3), 385-463. https://doi.org/10.1145/990308.990310

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