The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit-operation complexity of matrix multiplication and of all pair shortest path problem |
scientific article |
Statements
The bit-operation complexity of matrix multiplication and of all pair shortest path problem (English)
0 references
1981
0 references
