On the multiplicative complexity of the inversion and division of Hamiltonian quaternions
From MaRDI portal
Publication:1611099
DOI10.1007/s102080010021zbMath1001.68051OpenAlexW1979988162MaRDI QIDQ1611099
Peter Kirrinnis, Markus Bläser, 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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of associative rings (general theory) (16Z05)
This page was built for publication: On the multiplicative complexity of the inversion and division of Hamiltonian quaternions