Recommendations
- On computing subfields. A detailed description of the algorithm
- An efficient algorithm for the computation of Galois automorphisms
- scientific article; zbMATH DE number 4200323
- Computing subfields of number fields and applications to Galois group computations
- scientific article; zbMATH DE number 1075588
Cites work
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- scientific article; zbMATH DE number 1263407 (Why is no real title available?)
- A polynomial reduction algorithm
- An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
- Computation of Galois groups over function fields
- Computing Galois groups over the rationals
- Factoring Polynomials Over Algebraic Number Fields
- Factoring polynomials with rational coefficients
- Ideal decompositions and subfields
- Simplification of expressions involving radicals
- Solvability by radicals is in polynomial time
Cited in
(5)- Fusion systems of blocks of finite groups over arbitrary fields
- On computing subfields. A detailed description of the algorithm
- Computing subfields of number fields and applications to Galois group computations
- The complexity of computing all subfields of an algebraic number field
- Linear groups and computation
This page was built for publication: Block Systems of a Galois Group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4867488)
