From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From Circuit Complexity to Faster All-Pairs Shortest Paths |
scientific article; zbMATH DE number 7379590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From Circuit Complexity to Faster All-Pairs Shortest Paths |
scientific article; zbMATH DE number 7379590 |
Statements
From Circuit Complexity to Faster All-Pairs Shortest Paths (English)
0 references
9 August 2021
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
