Construct · 1 fields · 1 citations

APSP conjecture: 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 hypothesis that all-pairs shortest paths needs essentially cubic time, together with reductions showing many path and matrix problems stand or fall with it.

In computational complexity, APSP conjecture refers to the hypothesis that all-pairs shortest paths needs essentially cubic time, together with reductions showing many path and matrix problems stand or fall with it. This meaning comes from Williams (2018) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

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

See how APSP conjecture 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

complexity4 fields · 7 citationsjingle · one word, four constructs fall2 fields · 3 citationsjingle · one word, two constructs hypothesis2 fields · 2 citationsjingle · one word, two constructs

References

Williams, V. V., & Williams, R. R. (2018). Subcubic Equivalences Between Path, Matrix, and Triangle Problems. Journal of the ACM, 65(5), 1-38. https://doi.org/10.1145/3186893

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