Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)

DOI10.1145/345542.345620zbMath1326.68331OpenAlexW2042609201MaRDI QIDQ3454760

Gábor Ivanyos

Publication date: 26 November 2015

Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/345542.345620

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic systems of matrices (15A30) Randomized algorithms (68W20)

Related Items (8)

On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Groups acting on tensor products. ⋮ Intersecting two classical groups. ⋮ Splitting full matrix algebras over algebraic number fields. ⋮ The module isomorphism problem reconsidered. ⋮ Efficient decomposition of separable algebras. ⋮ Computing isometry groups of Hermitian maps ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing

This page was built for publication: Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)