book chapter · 2004

Designing a reduced-complexity algorithm for quaternion multiplication

Cited by 1Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Beasley, D. W. C. (2004). Designing a reduced-complexity algorithm for quaternion multiplication. https://doi.org/10.1887/0750308958/b386c87

MLA 9

Beasley, David W. C. “Designing a reduced-complexity algorithm for quaternion multiplication.” 2004, https://doi.org/10.1887/0750308958/b386c87.

Chicago

Beasley, David W. C. 2004. “Designing a reduced-complexity algorithm for quaternion multiplication.” https://doi.org/10.1887/0750308958/b386c87.

Harvard

Beasley, D.W.C. (2004) ‘Designing a reduced-complexity algorithm for quaternion multiplication’. Available at: https://doi.org/10.1887/0750308958/b386c87.

BibTeX

@incollection{beasley2004designing,
  title = {{Designing a reduced-complexity algorithm for quaternion multiplication}},
  author = {Beasley, David W. C.},
  year = {2004},
  doi = {10.1887/0750308958/b386c87}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.