On the complexity of quaternion multiplication

DOI10.1016/0020-0190(75)90036-8MaRDI QIDQ1223163zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 3394333 (Why is no real title available?)
• scientific article; zbMATH DE number 3408906 (Why is no real title available?)
• On multiplication of 2 2 matrices

Cited in

(11)

• Multiplicative complexity and algebraic structure
• 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
• On varieties of optimal algorithms for the computation of bilinear mappings. III. Optimal algorithms for the computation of xy and yx where x,y M₂(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 of direct sums of quadratic systems
• Some fast algorithms multiplying a matrix by its adjoint
• Generalizing Frobenius inversion to quaternion matrices
• \textsf{ABBA}: lattice-based commitments from commutators

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

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