Construct · 1 fields · 1 citations

small set expansion hypothesis: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed
small set expansionhypothesis1 CONSTRUCTSmall set expansionRAGHAVENDRA · APPROXIMATION

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

Approximation algorithms

the conjecture that distinguishing graphs where some small vertex set barely expands from graphs where all small sets expand is hard.

In approximation algorithms, small set expansion hypothesis refers to the conjecture that distinguishing graphs where some small vertex set barely expands from graphs where all small sets expand is hard. This meaning comes from Raghavendra (2010) in Proceedings of the forty-second ACM symposium on Theory of computing.[1]

Unit
Recovery means
Measured by

Next

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

See how small set expansion hypothesis 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

expansion4 fields · 4 citationsjingle · one word, four expansionshypothesis2 fields · 2 citationsjingle · one word, two constructs

References

  1. Raghavendra, P., & Steurer, D. (2010). Graph expansion and the unique games conjecture. Proceedings of the forty-second ACM symposium on Theory of computing. https://doi.org/10.1145/1806689.1806792

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