Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 15:01, 29 February 2024
scientific article; zbMATH DE number 6974578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster All-Pairs Shortest Paths via Circuit Complexity |
scientific article; zbMATH DE number 6974578 |
Statements
Faster All-Pairs Shortest Paths via Circuit Complexity (English)
0 references
7 November 2018
0 references
all-pairs shortest paths
0 references
graph algorithms
0 references
circuit complexity
0 references
matrix multiplication
0 references
tropical matrix multiplication
0 references
