Faster all-pairs shortest paths via circuit complexity (Q5259602)

From MaRDI portal
Revision as of 09:45, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6451596
Language Label Description Also known as
English
Faster all-pairs shortest paths via circuit complexity
scientific article; zbMATH DE number 6451596

    Statements

    title
    Faster all-pairs shortest paths via circuit complexity (English)
    0 references
    publication date
    26 June 2015
    0 references
    author
    R. Ryan Williams
    0 references
    describes a project that uses
    SuLQ
    0 references
    GotoBLAS
    0 references
    cites work
    Q5302085
    0 references
    Theory of Cryptography
    0 references
    Q3549600
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W20
    0 references
    05C12
    0 references
    05C20
    0 references
    05C35
    0 references
    05C38
    0 references
    65F30
    0 references
    zbMATH DE Number
    6451596
    0 references
    OpenAlex ID
    W2064790310
    0 references
    Wikidata QID
    Q56078256
    0 references
    arXiv ID
    1312.6680
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5259602&oldid=36081519"
    Powered by MediaWiki