On bilinear algorithms for multiplication in quaternion algebras

Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning

Standard

On bilinear algorithms for multiplication in quaternion algebras. / Lysikov, Vladimir.

2012.

Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning

Harvard

Lysikov, V 2012, 'On bilinear algorithms for multiplication in quaternion algebras'. <https://arxiv.org/abs/1206.5501>

APA

Lysikov, V. (2012). On bilinear algorithms for multiplication in quaternion algebras. https://arxiv.org/abs/1206.5501

Vancouver

Lysikov V. On bilinear algorithms for multiplication in quaternion algebras. 2012.

Author

Lysikov, Vladimir. / On bilinear algorithms for multiplication in quaternion algebras.

Bibtex

@conference{56cb07b8131743079a8c4924217e5143,
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.",
author = "Vladimir Lysikov",
year = "2012",
language = "English",

}

RIS

TY - ABST

T1 - On bilinear algorithms for multiplication in quaternion algebras

AU - Lysikov, Vladimir

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

M3 - Conference abstract for conference

ER -

ID: 232711848