Abstract
Exact algebraic algorithms for classical simple Lie algebras over fields of characteristic zero are considered. The complexity of an algebra in this computational model is defined as the number of (non-scalar) multiplications of an optimal algorithm (calculating the product of two elements of the algebra). Lower bounds for the algebraic complexity are obtained for algebras in the series , , and . Bibliography: 3 titles.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
