Loading [MathJax]/jax/output/SVG/config.js
Fundamentalnaya i Prikladnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Journal history

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Fundamentalnaya i Prikladnaya Matematika, 2009, Volume 15, Issue 7, Pages 127–136 (Mi fpm1273)  

Lower bounds for algebraic complexity of nilpotent associative algebras

A. V. Leont'ev

Program Systems Institute of RAS
References:
Abstract: Exact algebraic algorithms for calculating the product of two elements of nilpotent associative algebras over fields of characteristic zero are considered (this is a particular case of simultaneous calculation of several multinomials). The complexity of an algebra in this computational model is defined as the number of nonscalar multiplications of an optimal algorithm. Lower bounds for the tensor rank of nilpotent associative algebras (in terms of dimensions of certain subalgebras) are obtained, which give lower bounds for the algebraic complexity of this class of algebras. Examples of reaching of these estimates for different dimensions of the nilpotent algebras are presented.
English version:
Journal of Mathematical Sciences (New York), 2010, Volume 169, Issue 5, Pages 644–650
DOI: https://doi.org/10.1007/s10958-010-0065-0
Bibliographic databases:
Document Type: Article
UDC: 512.55
Language: Russian
Citation: A. V. Leont'ev, “Lower bounds for algebraic complexity of nilpotent associative algebras”, Fundam. Prikl. Mat., 15:7 (2009), 127–136; J. Math. Sci., 169:5 (2010), 644–650
Citation in format AMSBIB
\Bibitem{Leo09}
\by A.~V.~Leont'ev
\paper Lower bounds for algebraic complexity of nilpotent associative algebras
\jour Fundam. Prikl. Mat.
\yr 2009
\vol 15
\issue 7
\pages 127--136
\mathnet{http://mi.mathnet.ru/fpm1273}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2745005}
\elib{https://elibrary.ru/item.asp?id=15340715}
\transl
\jour J. Math. Sci.
\yr 2010
\vol 169
\issue 5
\pages 644--650
\crossref{https://doi.org/10.1007/s10958-010-0065-0}
\elib{https://elibrary.ru/item.asp?id=15329343}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77956055837}
Linking options:
  • https://www.mathnet.ru/eng/fpm1273
  • https://www.mathnet.ru/eng/fpm/v15/i7/p127
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Фундаментальная и прикладная математика
     
      Contact us:
    math-net2025_01@mi-ras.ru
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025