Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 1993, Volume 5, Issue 4, Pages 151–157 (Mi dm711)  
On Losev's method for fast vector-matrix multiplication

F. F. Zheludevich
Full-text PDF (465 kB)
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
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: F. F. Zheludevich, “On Losev's method for fast vector-matrix multiplication”, Diskr. Mat., 5:4 (1993), 151–157
Citation in format AMSBIB
\Bibitem{Zhe93}
\by F.~F.~Zheludevich
\paper On Losev's method for fast vector-matrix multiplication
\jour Diskr. Mat.
\yr 1993
\vol 5
\issue 4
\pages 151--157
\mathnet{http://mi.mathnet.ru/dm711}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1261035}
\zmath{https://zbmath.org/?q=an:0816.65026}
Linking options:
  • https://www.mathnet.ru/eng/dm711
  • https://www.mathnet.ru/eng/dm/v5/i4/p151
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:278
    Full-text PDF :116
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024