On Losev's method for fast vector-matrix multiplication
Diskretnaya Matematika, Tome 5 (1993) no. 4, pp. 151-157.

Voir la notice de l'article provenant de 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},
     publisher = {mathdoc},
     volume = {5},
     number = {4},
     year = {1993},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1993_5_4_a11/}
}
TY  - JOUR
AU  - F. F. Zheludevich
TI  - On Losev's method for fast vector-matrix multiplication
JO  - Diskretnaya Matematika
PY  - 1993
SP  - 151
EP  - 157
VL  - 5
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1993_5_4_a11/
LA  - ru
ID  - DM_1993_5_4_a11
ER  - 
%0 Journal Article
%A F. F. Zheludevich
%T On Losev's method for fast vector-matrix multiplication
%J Diskretnaya Matematika
%D 1993
%P 151-157
%V 5
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1993_5_4_a11/
%G ru
%F 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/