Fast decomposition of polynomials with known Galois group

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2643, Issue , 2003, Pages 254-264

  Enge, Andreas ^a   Morain, François ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

AUTOMORPHISM GROUPS; FAST DECOMPOSITION; FIELD EXTENSIONS; GALOIS GROUP; INTERMEDIATE FIELDS; POLYNOMIAL ARITHMETIC; QUADRATIC FIELDS; SPEED UP;

POLYNOMIALS;

EID: 35248841635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44828-4_27     Document Type: Article

References (15)

1. A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Math. Comp., 61(203):29-68, July 1993.
2. J.D. Dixon. Computing subfields in algebraic number fields. J. Austral. Math. Soc. Ser. A, 49:434-448, 1990.
3. A. Enge, P. Gaudry, G. Hanrot, and P. Zimmermann. Reconstructing a polynomial from, its roots. In preparation, 2002.
4. A. Enge and F. Morain. Further investigations of the generalised Weber functions. Preprint, July 2001.
5. A. Enge and F. Morain. Comparing invariants for class fields of imaginary quadratic fields. In C. Fieker and D. R. Kohel, editors, ANTS IV - Algorithmic Number Theory, volume 2369 of Lecture Notes in Comput. Sci., pages 252-266. Springer-Verlag, 2002.
6. A. Enge and R. Schertz. Constructing elliptic curves from modular curves of positive genus. Preprint, 2001.
7. A. Enge and P. Zimmermann, mpc - a library for multiprecision complex arithmetic with exact rounding. Version 0.4.1, available from http://www.lix.polytechnique.fr/Labo/Andreas.Enge.
8. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 1999.
9. T. Granlund et. al. gmp - gnu multiprecision library. Version 4.1.2, available from http://www.swox.com/gmp.
10. G. Hanrot, V. Lefèvre, and P. Zimmermann et. al. mpfr - a library for multiple-precision floating-point computations with exact rounding. Version contained in [9]. Available from http://www.mpfr.org.
11. G. Hanrot and F. Morain. Solvability by radicals from an algorithmic point of view. In B. Mourrain, editor, Symbolic and algebraic computation, pages 175-182. ACM, 2001. Proceedings ISSAC'2001, London, Ontario.
12. G. Hanrot and F. Morain. Solvability by radicals from a practical algorithmic point of view. Submitted. Available from http://www.lix.polytechnique.fr/ Labo/Francois.Morain, November 2001.
13. E. Hecke. Vorlesungen über die Theorie der algebraischen Zahlen. Chelsea Publishing Company, 2nd ed., 1970.
14. J. Klüners. On computing subfields. A detailed description of the algorithm. J. Théor. Nombres Bordeaux, 10:243-271, 1998.
15. J. Klüners and M. Pohst. On computing subfields. J. Symbolic Comput., 24:385-397, 1997.