The Complexity of the Quaternion Product.
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. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1975
- Accession Number
- ADA013505
Entities
People
- Jean-claude Lafon
- Thomas D. Howell
Organizations
- Department of Computer Science, Cornell University