On Losev's method for fast vector-matrix multiplication
Diskretnaya Matematika, Tome 5 (1993) no. 4, pp. 151-157
Cet article a éte moissonné depuis la source Math-Net.Ru
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$.
@article{DM_1993_5_4_a11,
author = {F. F. Zheludevich},
title = {On {Losev's} method for fast vector-matrix multiplication},
journal = {Diskretnaya Matematika},
pages = {151--157},
year = {1993},
volume = {5},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_1993_5_4_a11/}
}
F. F. Zheludevich. On Losev's method for fast vector-matrix multiplication. Diskretnaya Matematika, Tome 5 (1993) no. 4, pp. 151-157. http://geodesic.mathdoc.fr/item/DM_1993_5_4_a11/