The Complexity of the Quaternion Product
Howell, Thomas D.; Lafon, Jean-Claude
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.
computer science; technical report
Previously Published As