The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952)
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: The bit-operation complexity of matrix multiplication and of all pair shortest path problem |
scientific article; zbMATH DE number 3723854
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bit-operation complexity of matrix multiplication and of all pair shortest path problem |
scientific article; zbMATH DE number 3723854 |
Statements
The bit-operation complexity of matrix multiplication and of all pair shortest path problem (English)
0 references
1981
0 references
0 references
