Fast Decomposition of Polynomials with Known Galois Group
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3924140
- Galois group computation for rational polynomials
- Computing Galois groups of certain families of polynomials
- Computation of Galois groups of rational polynomials
- Computation of the Galois group of a polynomial with rational coefficients. I
- scientific article; zbMATH DE number 1253982
- scientific article; zbMATH DE number 4112724
- scientific article; zbMATH DE number 3959582
- A modular method for computing the Galois groups of polynomials
- Fast polynomial factorization and modular composition
Cited in
(14)- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Computing Igusa class polynomials
- Computing class polynomials for abelian surfaces
- Computation schemes for splitting fields of polynomials
- Solvability by radicals from an algorithmic point of view
- Explicit isogenies in quadratic time in any characteristic
- Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
- Detecting fast solvability of equations via small powerful Galois groups
- Construction de corps de décomposition grace aux facteurs de résolvantes
- Accelerating the CM method
- Applications of Algebra for Some Game Theoretic Problems
- Algorithmic Number Theory
- Dynamic Galois theory
- FastECPP over MPI
This page was built for publication: Fast Decomposition of Polynomials with Known Galois Group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4426704)
