Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/15m1024524 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2898839814 / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
