On bilinear algorithms for multiplication in quaternion algebras

Publikation: KonferencebidragKonferenceabstrakt til konferenceForskning

  • Vladimir Lysikov
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.
OriginalsprogEngelsk
Publikationsdato2012
StatusUdgivet - 2012
Eksternt udgivetJa

ID: 232711848