On the multiplicative complexity of the inversion and division of Hamiltonian quaternions

DOI10.1007/S102080010021MaRDI QIDQ1611099zbMATH OpenOpenAlexFDO

Authors Markus Bläser, Peter Kirrinnis, Daniel Lauer

Publication date 6 October 2002

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s102080010021

zbMATH Keywords

Hamiltonian quaternions

Mathematics Subject Classification ID

Computational aspects of associative rings (general theory) (16Z05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The Computational Complexity of Division in Quadratic Extension Fields
• A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
• On the invertibility of a linear function on the quaternions
• Algorithms and Computation
• On some algebras connected with fast algorithms

Cited in

(1)

• The Computational Complexity of Division in Quadratic Extension Fields

This page was built for publication: On the multiplicative complexity of the inversion and division of Hamiltonian quaternions

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