On the complexity of quaternion multiplication

DOI10.1016/0020-0190(75)90036-8zbMath0321.68038OpenAlexW2015087659MaRDI QIDQ1223163

Hans F. de Groote

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90036-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (9)

Multiplicative complexity of direct sums of quadratic systems ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication ⋮ Some fast algorithms multiplying a matrix by its adjoint ⋮ On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of \(xy\) and \(yx\) where \(x,y\in M_2(K)\) ⋮ Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics ⋮ The complexity of vector-products ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ Multiplicative complexity and algebraic structure

Cites Work

• On multiplication of 2 \(\times\) 2 matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of quaternion multiplication