Faster all-pairs shortest paths via circuit complexity (Q5259602): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: SuLQ / rank | |||
Normal rank |
Revision as of 13:09, 29 February 2024
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
Faster all-pairs shortest paths via circuit complexity (English)
0 references
26 June 2015
0 references