The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952)
From MaRDI portal
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
0 references
