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

From MaRDI portal
Revision as of 01:13, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1981
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references