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

From MaRDI portal
Revision as of 11:27, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    The bit-operation complexity of matrix multiplication and of all pair shortest path problem (English)
    0 references
    publication date
    1981
    0 references
    author
    Pan, Victor Y.
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    65F30
    0 references
    05C38
    0 references
    zbMATH DE Number
    3723854
    0 references
    OpenAlex ID
    W2139007071
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1152952&oldid=34652499"
    Powered by MediaWiki