|
|||||
|
|
On the complexity of some algorithms of matrix multiplication |
|
| Authors: | Valery B Alekseyev |
| Affiliation: | Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow 117234, USSR |
| Abstract: | It is shown that the multiplicative complexity of multiplication of a 3 × 2 matrix by a 2 × 2 matrix is equal to 11 for arbitrary field of constants. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |