On bilinear algorithms for multiplication in quaternion algebras
Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning
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.
Originalsprog | Engelsk |
---|---|
Publikationsdato | 2012 |
Status | Udgivet - 2012 |
Eksternt udgivet | Ja |
Links
- https://arxiv.org/abs/1206.5501
Andet version
ID: 232711848