Faster all-pairs shortest paths via circuit complexity (Q4554074)
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: Faster all-pairs shortest paths via circuit complexity |
scientific article; zbMATH DE number 6974578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9972749948501588
0 references
0.983869969844818
0 references
0.8555501699447632
0 references
0.8443558812141418
0 references
