The Complexity of the Quaternion Product

Authors:
Thomas D. Howell;Jean Lafon
Affiliations:
-;-
Venue:
The Complexity of the Quaternion Product
Year:
1975

Citing 0
Cited 3

On the complexity of bilinear forms with commutativity

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Quaternionic lattice structures for four-channel paraunitary filter banks

EURASIP Journal on Applied Signal Processing
Quaternion multiplier inspired by the lifting implementation of plane rotations

IEEE Transactions on Circuits and Systems Part I: Regular Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let X and Y be two quaternions over an arbitrary ring. Eight multiplications are necessary and sufficient for computing the product XY. If the ring is assumed to be commutative, at least seven multiplications are still necessary and eight are sufficient.