On an optimal algorithm for matrix multiplication (Q1178429)
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: On an optimal algorithm for matrix multiplication |
scientific article; zbMATH DE number 21591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an optimal algorithm for matrix multiplication |
scientific article; zbMATH DE number 21591 |
Statements
On an optimal algorithm for matrix multiplication (English)
0 references
26 June 1992
0 references
A one multiplication algorithm for nonnegative integer matrix multiplication is presented and it is claimed that the computational complexity of the algorithm is not only depending on the number of operators needed but also essentially depends on the word length of the operands, which is neglected in the paper by \textit{C. Jiang} and \textit{Z. Wu} [ibid. 35, No. 4, 268-272 (1990; Zbl 0697.65038)].
0 references
optimal algorithm
0 references
one multiplication algorithm
0 references
nonnegative integer matrix multiplication
0 references
computational complexity
0 references
number of operators
0 references
