The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952): Difference between revisions
From MaRDI portal
Latest revision as of 11:27, 13 June 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
0 references