Lower bounds for algebraic complexity of nilpotent associative algebras.
DOI10.1007/S10958-010-0065-0zbMATH Open1221.16033OpenAlexW2000083017MaRDI QIDQ548764FDOQ548764
Authors: A. V. Leont'ev
Publication date: 30 June 2011
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-010-0065-0
Recommendations
- Lower bounds on algebraic algorithms for nilpotent associative algebras
- Lower bounds for the bilinear complexity of associative algebras
- Lower bounds for algebraic algorithms for nilpotent and solvable Lie algebras
- Lower bounds for algebraic complexity of classical simple Lie algebras
- COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY
- Publication:4725743
- Complexity functions of varieties of Leibniz algebras with nilpotent commutator subalgebra
- Two bounds for the nilpotence class of an algebra
- A lower bound on the essential dimension of simple algebras.
- On Commutative Power-Associative Nilalgebras of Low Dimension
algorithmsalgebraic complexitynilpotent algebrastensor rankscomplexities of algebrasproducts of elements
Symbolic computation and algebraic computation (68W30) Computational aspects of associative rings (general theory) (16Z05) Nil and nilpotent radicals, sets, ideals, associative rings (16N40)
Cites Work
Cited In (2)
This page was built for publication: Lower bounds for algebraic complexity of nilpotent associative algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548764)