Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074)

From MaRDI portal
Revision as of 19:19, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q937200)
scientific article; zbMATH DE number 6974578
Language Label Description Also known as
English
Faster All-Pairs Shortest Paths via Circuit Complexity
scientific article; zbMATH DE number 6974578

    Statements

    Faster All-Pairs Shortest Paths via Circuit Complexity (English)
    0 references
    7 November 2018
    0 references
    all-pairs shortest paths
    0 references
    graph algorithms
    0 references
    circuit complexity
    0 references
    matrix multiplication
    0 references
    tropical matrix multiplication
    0 references

    Identifiers

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