The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952)

From MaRDI portal
Revision as of 22:49, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q163211)





scientific article
Language Label Description Also known as
English
The bit-operation complexity of matrix multiplication and of all pair shortest path problem
scientific article

    Statements

    The bit-operation complexity of matrix multiplication and of all pair shortest path problem (English)
    0 references
    1981
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references