Lower bounds for algebraic algorithms for nilpotent and solvable Lie algebras

DOI10.3103/S1066369X10030035zbMath1234.17001OpenAlexW2069403966MaRDI QIDQ1956584

A. V. Leont'ev

Publication date: 23 September 2010

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x10030035

zbMATH Keywords

solvable Lie algebraslower boundsalgebraic complexitynilpotent Lie algebrastensor rankexact algebraic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Solvable, nilpotent (super)algebras (17B30) Computational methods for problems pertaining to nonassociative rings and algebras (17-08)

Cites Work

• On the algorithmic complexity of associative algebras
• On the multiplicative complexity of Lie algebras
• Unnamed Item

This page was built for publication: Lower bounds for algebraic algorithms for nilpotent and solvable Lie algebras