A note on 'Is shortest path problem not harder than matrix multiplication?' (Q1158968)
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: A note on 'Is shortest path problem not harder than matrix multiplication?' |
scientific article; zbMATH DE number 3744565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on 'Is shortest path problem not harder than matrix multiplication?' |
scientific article; zbMATH DE number 3744565 |
Statements
A note on 'Is shortest path problem not harder than matrix multiplication?' (English)
0 references
1981
0 references
bitwise complexity
0 references
total arithmetic complexity
0 references
reducibility
0 references
