Multiplicative complexity and algebraic structure

DOI10.1016/0022-0000(83)90023-5zbMath0517.68060OpenAlexW2035876999MaRDI QIDQ1053459

Dave Riffelmacher

Publication date: 1983

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(83)90023-5

zbMATH Keywords

central simple algebrascrossed producttensor rankmultiplicative complexityassociative algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Separable algebras (e.g., quaternion algebras, Azumaya algebras, etc.) (16H05)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of quaternion multiplication
• Lower bounds of the complexity of linear algebras
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• On central division algebras
• Algebras Having Linear Multiplicative Complexities
• A Determination of All Normal Division Algebras Over an Algebraic Number Field

This page was built for publication: Multiplicative complexity and algebraic structure