Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
Gábor Ivanyos · 2000
We discuss randomized algorithms 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 poly-logarithmic number of matrix multiplications.