Solvability by radicals from an algorithmic point of view

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 175-182

  Hanrot, G ^a   Morain, F ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; NUMERICAL METHODS; POLYNOMIALS; THEOREM PROVING;

ABELIAN SOLVABLE EQUATIONS; GALOIS THEORY; HILBERT CLASS FIELDS; IMAGINARY QUADRATIC FIELDS; NON-ABELIAN SOLVABLE EQUATIONS; POLYNOMIAL EQUATION; SOLVABLE GALOIS GROUP;

PROBLEM SOLVING;

EID: 0034782089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384125     Document Type: Conference Paper

References (23)

1. Computing automorphisms of Abelian number fields
2. A new algorithm for the computation of Galois automorphisms
3. Elliptic curves and primality proving
4. Heuristics on class groups of number fields
5. Über die praktische Auflösung von Gleichungen höheren Grades
6. Extensions abéliennes non ramifiées de degré premier d'un corps quadratique
7. Factorization of polynomials over finite fields and factorization of primes in algebraic number fields
8. Riemann hypothesis and finding roots over finite fields
9. Factorization of polynomials over finite fields and decomposition of primes in algebraic number fields
10. Generalized Riemann hypothesis and factoring polynomials over finite fields
11. Sur les corps résolubles de degré premier
12. Solvability by radicals is in polynomial time
13. Algorithms in algebraic number theory
14. Polynômes à groupe de Galois diédral
15. Construction of Hilbert class fields of imaginary quadratic fields and dihedral equations modulo
16. Solving generalized dihedral equations
17. Three methods for computing Hilbert polynomials