Riemann hypothesis and finding roots over finite fields
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Generalized Riemann hypothesis and factoring polynomials over finite fields
Journal of Algorithms
A course in computational algebraic number theory
A course in computational algebraic number theory
Computing automorphisms of abelian number fields
Mathematics of Computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Comparing Invariants for Class Fields of Imaginary Quadratic Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Partial solvability by radicals
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Fast decomposition of polynomials with known Galois group
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Hi-index | 0.00 |
Any textbook on Galois theory contains a proof that a polynomial equation with solvable Galois group can be solved by radicals. From a practical point of view, we need to find suitable representations of the group and the roots of the polynomial. We first reduce the problem to that of cyclic extensions of prime degree and then work out the radicals, using the work of Girstmair. We give numerical examples of Abelian and non-Abelian solvable equations and apply the general framework to the construction of Hilbert Class fields of imaginary quadratic fields.