Fast randomized algorithms for the structure of matrix algebras over finite fields
Gábor Ivanyos · SZTAKI Publication Repository (Hungarian Academy of Sciences) · 1999
Randomized algorithms are discussed which compute algebra generators of a Wedderburn complement as well as ideal generators of the radical of a matrix algebra over a finite field given by algebra generators. The cost of the algorithms is comparable to that of a few matrix multiplications.