Construct · 1 fields · 1 citations

3SUM-hardness: 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

the use of the 3SUM problem, believed to need roughly quadratic time, as a base for reductions showing many geometric problems are equally hard.

In computational complexity, 3SUM-hardness refers to the use of the 3SUM problem, believed to need roughly quadratic time, as a base for reductions showing many geometric problems are equally hard. This meaning comes from Gajentaan (1995) in Computational Geometry.[1]

Unit
Recovery means
Measured by

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

See how 3SUM-hardness 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

base3 fields · 4 citationsjingle · one word, three constructs complexity4 fields · 7 citationsjingle · one word, four constructs need3 fields · 4 citationsjingle · one word, three constructs

References

Gajentaan, A., & Overmars, M. H. (1995). On a class of O(n2) problems in computational geometry. Computational Geometry, 5(3), 165-185. https://doi.org/10.1016/0925-7721(95)00022-2

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