Paper Info
Title
On bilinear algorithms for multiplication in quaternion algebras
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).
Year
Venue
DocType
2012
arXiv: Computational Complexity
Journal
Volume
ISSN
Citations 
abs/1206.5501
Proceedings of the XI international seminar "Discrete mathematics and its applications", pp. 141--144 (in Russian). http://mech.math.msu.su/department/dm/dmmc/CONF/sbornik_2012.pdf
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Vladimir Lysikov112.40