Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2019, Number 2, Pages 3–8 (Mi vmumm606)  
Mathematics

A simple proof for the upper bound of the computational complexity of three monomials in three variables

V. V. Kocherginab

a Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
b National Research University "Higher School of Economics", Moscow
Full-text PDF (200 kB)
References:
PDF
HTML
Abstract: The problem of the minimal number of multiplication operations sufficient for the joint computing of three monomials in three variables is considered. For this problem, we propose a simple proof of the upper bound asymptotically equal to the lower bound. The known proof of a similar bound contains more than 60 pages.
Key words: complexity of evaluation of monomials, vectorial addition chains, complexity of circuits.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00-337-а
Received: 13.04.2018
English version:
Moscow University Mathematics Bulletin, 2019, Volume 74, Issue 2, Pages 43–48
DOI: https://doi.org/10.3103/S0027132219020013
Bibliographic databases:
Document Type: Article
UDC: 519.71
Language: Russian
Citation: V. V. Kochergin, “A simple proof for the upper bound of the computational complexity of three monomials in three variables”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2019, no. 2, 3–8; Moscow University Mathematics Bulletin, 74:2 (2019), 43–48
Citation in format AMSBIB
\Bibitem{Koc19}
\by V.~V.~Kochergin
\paper A simple proof for the upper bound of the computational complexity of three monomials in three variables
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2019
\issue 2
\pages 3--8
\mathnet{http://mi.mathnet.ru/vmumm606}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3951990}
\zmath{https://zbmath.org/?q=an:07096731}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2019
\vol 74
\issue 2
\pages 43--48
\crossref{https://doi.org/10.3103/S0027132219020013}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000466898100001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85065259772}
Linking options:
  • https://www.mathnet.ru/eng/vmumm606
  • https://www.mathnet.ru/eng/vmumm/y2019/i2/p3
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:178
    Full-text PDF :29
    References:45
    First page:14
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024