An optimal algorithm for matrix multiplication (Q911703)
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: Publication:911703 |
scientific article; zbMATH DE number 4143352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for matrix multiplication |
scientific article; zbMATH DE number 4143352 |
Statements
An optimal algorithm for matrix multiplication (English)
0 references
1990
0 references
An \(O(n^ 2)\) algorithm for matrix multiplication is given for matrices with all rational elements. The authors point out the fact that although the results are theoretically important, the implementation of the algorithm may be difficult since it requires the use of very large integers and, presently, most computers cannot handle such integers.
0 references
rational elements
0 references
matrices of integers
0 references
matrix multiplication
0 references
algorithm
0 references
0.8555310368537903
0 references
0.8522120714187622
0 references
0.8452848196029663
0 references
0.8452848196029663
0 references
