Decomposition of algebras over finite fields and number fields
From MaRDI portal
Publication:685720
DOI10.1007/BF01272520zbMath0774.68068MaRDI QIDQ685720
Publication date: 10 October 1993
Published in: Computational Complexity (Search for Journal in Brave)
Related Items (13)
How to compute the Wedderburn decomposition of a finite-dimensional associative algebra ⋮ Computational Arithmetic of Modular Forms ⋮ Algorithmic properties of maximal orders in simple algebras over \(\mathbb{Q}\) ⋮ Computing generators of the unit group of an integral Abelian group ring. ⋮ Cryptographic algorithms on groups and algebras ⋮ Irreducibility testing of finite nilpotent linear groups. ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) ⋮ Decomposition of algebras over finite fields and number fields ⋮ Maximal subgroup growth of some metabelian groups ⋮ A note on locality of algebras ⋮ Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\) ⋮ Algebraic reduction methods and their applications to matrix continued fractions
Cites Work
- Decomposition of algebras over finite fields and number fields
- On computing the determinant in small parallel time using a small number of processors
- Irreducibility of multivariate polynomials
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- Factoring polynomials with rational coefficients
- Parallel Algorithms for Algebraic Problems
- CHARACTERIZATION OF BLOW-UP FOR A SEMILINEAR HEAT EQUATION WITH A CONVECTION TERM
- Factoring Polynomials over Algebraic Number Fields
- Zero divisors in quaternion algebras
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Probabilistic Algorithms in Finite Fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Computing Irreducible Representations of Finite Groups
- Fast parallel matrix and GCD computations
- New Methods for Reduction of Group Representations Using an Extension of Schur's Lemma
- New Methods for Reduction of Group Representations. II
- New Methods for Reduction of Group Representations. III
- New Methods for Reduction of Group Representations. IV
- Factoring Polynomials Over Large Finite Fields
This page was built for publication: Decomposition of algebras over finite fields and number fields
