Multiplicative complexity and algebraic structure

DOI10.1016/0022-0000(83)90023-5MaRDI QIDQ1053459zbMATH OpenOpenAlexFDO

Authors 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

crossed productmultiplicative complexitytensor rankassociative algebrascentral simple algebras

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1022141 (Why is no real title available?)
• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• A Determination of All Normal Division Algebras Over an Algebraic Number Field
• Algebras Having Linear Multiplicative Complexities
• Gaussian elimination is not optimal
• Lower bounds of the complexity of linear algebras
• On central division algebras
• On multiplication of 2 2 matrices
• On the complexity of quaternion multiplication

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1053459)