Subcubic Equivalences Between Path, Matrix, and Triangle Problems (Q4625648): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q129321976, #quickstatements; #temporary_batch_1728330931406 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3186893 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2892948282 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129321976 / rank | |||
Normal rank | |||
Latest revision as of 21:47, 7 October 2024
scientific article; zbMATH DE number 7029212
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subcubic Equivalences Between Path, Matrix, and Triangle Problems |
scientific article; zbMATH DE number 7029212 |
Statements
Subcubic Equivalences Between Path, Matrix, and Triangle Problems (English)
0 references
25 February 2019
0 references
fine-grained complexity
0 references
all-pairs shortest paths
0 references
equivalences
0 references
fine-grained reductions
0 references
subcubic time
0 references
