Faster all-pairs shortest paths via circuit complexity (Q5259602): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56078256, #quickstatements; #temporary_batch_1711565664090 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1312.6680 / rank | |||
Normal rank | |||
Revision as of 00:43, 20 April 2024
scientific article; zbMATH DE number 6451596
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster all-pairs shortest paths via circuit complexity |
scientific article; zbMATH DE number 6451596 |
Statements
Faster all-pairs shortest paths via circuit complexity (English)
0 references
26 June 2015
0 references
