A note on 'Is shortest path problem not harder than matrix multiplication?' (Q1158968)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on 'Is shortest path problem not harder than matrix multiplication?' |
scientific article |
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
