On bilinear algorithms for multiplication in quaternion algebras

Research output: Contribution to conferenceConference abstract for conferenceResearch

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.
Original languageEnglish
Publication date2012
Publication statusPublished - 2012
Externally publishedYes

ID: 232711848