Subcubic Equivalences Between Path, Matrix, and Triangle Problems (Q4625648)

From MaRDI portal
Revision as of 21:47, 7 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129321976, #quickstatements; #temporary_batch_1728330931406)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7029212
Language Label Description Also known as
English
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
scientific article; zbMATH DE number 7029212

    Statements

    Subcubic Equivalences Between Path, Matrix, and Triangle Problems (English)
    0 references
    25 February 2019
    0 references
    fine-grained complexity
    0 references
    all-pairs shortest paths
    0 references
    equivalences
    0 references
    fine-grained reductions
    0 references
    subcubic time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references