On computing subfields. A detailed description of the algorithm
From MaRDI portal
Recommendations
- Block Systems of a Galois Group
- Computing subfields of number fields and applications to Galois group computations
- scientific article; zbMATH DE number 1075588
- Generating subfields
- Generating subfields
- scientific article; zbMATH DE number 4200323
- The complexity of computing all subfields of an algebraic number field
- Isomorphisms of algebraic number fields
- Subexponential algorithms for class group and unit computations
- Reducing number field defining polynomials: an application to class group computations
Cites work
- scientific article; zbMATH DE number 421665 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 4200323 (Why is no real title available?)
- scientific article; zbMATH DE number 3957242 (Why is no real title available?)
- scientific article; zbMATH DE number 1075588 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 2107000 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- A polynomial reduction algorithm
- An Inequality About Factors of Polynomials
- Block Systems of a Galois Group
- Efficient rational number reconstruction
- Factoring Polynomials Over Algebraic Number Fields
- Factoring Polynomials over Algebraic Number Fields
- Ideal decompositions and subfields
- Imprimitive Ninth-Degree Number Fields with Small Discriminants
- KANT V4
- On computing subfields
- Solvability by radicals is in polynomial time
Cited in
(15)- An efficient algorithm for the computation of Galois automorphisms
- Block Systems of a Galois Group
- Factorization and root-finding for polynomials over division quaternion algebras
- scientific article; zbMATH DE number 421665 (Why is no real title available?)
- scientific article; zbMATH DE number 1075588 (Why is no real title available?)
- Algorithms for Function Fields
- Topics in computational algebraic number theory
- Computing subfields of number fields and applications to Galois group computations
- The complexity of computing all subfields of an algebraic number field
- Generating subfields
- Numerical calculation of three-point branched covers of the projective line
- Computing Galois groups
- A polynomial with Galois group \(\text{SL}_2(11)\)
- Galois group computation for rational polynomials
- Explicit Galois realization of transitive groups of degree up to 15
This page was built for publication: On computing subfields. A detailed description of the algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292617)
