A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q

We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms 1994, Vol.16 (1), p.24-32
1. Verfasser:	Ronyai, L.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!