Faster all-pairs shortest paths via circuit complexity (Q5259602)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6451596
| 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 6451596 |
Statements
Faster all-pairs shortest paths via circuit complexity (English)
0 references
26 June 2015
0 references
0 references
0 references
0.9972749948501588
0 references
0.9824000597000122
0 references
0.8616082668304443
0 references
0.8474016189575195
0 references
