|
On Losev's method for fast vector-matrix multiplication
F. F. Zheludevich
Abstract:
We propose an improvement of the algorithm of V. V. Losev [Radio Engrg. Electron. Phys. 25 (1980), no. 11, 116–119 (1982); MR0647612 (83f:94007)] which reduces the additive complexity of the multiplication of a binary $M\times M$ matrix (the elements of this matrix are $\pm1$) by a real vector, up to $M^2/\log_2M$ as $M\to\infty$.
Received: 03.12.1991
Citation:
F. F. Zheludevich, “On Losev's method for fast vector-matrix multiplication”, Diskr. Mat., 5:4 (1993), 151–157
Linking options:
https://www.mathnet.ru/eng/dm711 https://www.mathnet.ru/eng/dm/v5/i4/p151
|
Statistics & downloads: |
Abstract page: | 278 | Full-text PDF : | 116 | First page: | 1 |
|