On bilinear algorithms for multiplication in quaternion algebras
Computational Complexity
2012-08-29 v2
Abstract
We show that the bilinear complexity of multiplication in a non-split quaternion algebra over a field of characteristic distinct from 2 is 8. This question is motivated by the problem of characterising algebras of almost minimal rank studied by Blaeser and de Voltaire in [1]. This paper is a translation of a report submitted by the author to the XI international seminar "Discrete mathematics and applications" (in Russian).
Cite
@article{arxiv.1206.5501,
title = {On bilinear algorithms for multiplication in quaternion algebras},
author = {Vladimir Lysikov},
journal= {arXiv preprint arXiv:1206.5501},
year = {2012}
}
Comments
2 pages, LaTeX; grammar fix