Computation of the Decomposition Group of a Triangular Ideal, Applicable Algebra in Engineering, Communication and Computing, vol.6, issue.3-4, pp.3-4279, 2004. ,
DOI : 10.1007/s00200-004-0160-x
URL : https://hal.archives-ouvertes.fr/hal-00556814
Computation of the splitting fields and the Galois groups of polynomials, pp.29-50, 1996. ,
DOI : 10.1007/978-3-0348-9104-2_3
Using Galois Ideals for Computing Relative Resolvents, Journal of Symbolic Computation, vol.30, issue.6, pp.635-651, 2000. ,
DOI : 10.1006/jsco.2000.0376
URL : https://hal.archives-ouvertes.fr/inria-00099277
The Magma Algebra System I: The User Language, Computational algebra and number theory, pp.3-4235, 1993. ,
DOI : 10.1006/jsco.1996.0125
Homotopy methods for multiplication modulo triangular sets. ArXiv e-prints, 2009. ,
A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, vol.138, 1993. ,
DOI : 10.1007/978-3-662-02945-9
Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics, 1991. ,
Sharp estimates for triangular sets, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.103-110, 2004. ,
DOI : 10.1145/1005285.1005302
Dynamic Galois Theory, Journal of Symbolic Computation, vol.45, issue.12, pp.1316-1329, 2010. ,
DOI : 10.1016/j.jsc.2010.06.012
Construction de corps de d??composition grace aux facteurs de r??solvantes, Communications in Algebra, vol.93, issue.2, pp.903-924, 2000. ,
DOI : 10.1090/S0025-5718-1973-0327712-4
Galois Group Computation for Rational Polynomials, Algorithmic methods in Galois theory, pp.653-674, 2000. ,
DOI : 10.1006/jsco.2000.0377
Algorithms for a multiple algebraic extension In Effective Methods in Algebraic Geometry, Progress in Mathematics Birkhäuser, vol.94, pp.235-248, 1991. ,
Algorithms for a multiple algebraic extension II Algebraic Algorithms and Error-Correcting Codes, Applied Algebra, pp.234-233, 1991. ,
Explicit constructions in splitting fields of polynomials, Riv. Mat. Univ. Parma, issue.7 3, pp.233-244, 2004. ,
Fast arithmetic for triangular sets, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.891-907, 2009. ,
DOI : 10.1145/1277548.1277585
Calcul de corps de décomposition -Utilisations fines d'ensembles de permutations en théorie de Galois effective, 2006. ,
Computation schemes for splitting fields of polynomials, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.279-286, 2009. ,
DOI : 10.1145/1576702.1576741
URL : https://hal.archives-ouvertes.fr/hal-01294703
Algorithmic algebraic number theory, volume 30 of Encyclopedia of Mathematics and its Applications, 1997. ,
A Modular Method for Computing the Splitting Field of a Polynomial, Algorithmic Number Theory Symposium, 2006. ,
DOI : 10.1007/11792086_10
URL : https://hal.archives-ouvertes.fr/hal-01337040
Multi-modular algorithm for computing the splitting field of a polynomial, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.247-254, 2008. ,
DOI : 10.1145/1390768.1390803
URL : https://hal.archives-ouvertes.fr/hal-01305625
Calcul de r??solvantes avec les modules de Cauchy, Experimental Mathematics, vol.21, issue.22, pp.351-366, 1999. ,
DOI : 10.1090/S0025-5718-1973-0327712-4
A modular method for computing the Galois groups of polynomials, Journal of Pure and Applied Algebra, vol.117, issue.118, pp.617-636, 1996. ,
DOI : 10.1016/S0022-4049(97)00030-3
Université du Havre 25 rue Philippe Lebon 76600 Le Havre, France e-mail: sebastien.orange@univ-lehavre ,