Solvability by Radicals is in Polynomial Time

  title={Solvability by Radicals is in Polynomial Time},
  author={Susan Landau and Gary L. Miller},
  journal={J. Comput. Syst. Sci.},
A polynomial time algorithm is presented for the founding question of Galois theory: determining solvability by radicals of a monic irreducible polynomial over the integers. Also a polynomial time algorithm which expresses a root in radicals in terms of a straightline program is given. Polynomial time algorithms are demonstrated for computing blocks of imprimitivity of roots of the polynomial under the action of the Galois group, and for computing intersections of algebraic number fields. In… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 68 extracted citations

Testing nilpotence of galois groups in polynomial time

ACM Trans. Algorithms • 2012
View 10 Excerpts
Highly Influenced

Decomposition of Polynomials

ArXiv • 2011
View 6 Excerpts
Highly Influenced

Upper Bounds on the Complexity of some Galois Theory Problems

Electronic Colloquium on Computational Complexity • 2003
View 5 Excerpts
Highly Influenced

On Polynomial Decompositions

J. Symb. Comput. • 1999
View 4 Excerpts
Highly Influenced

Computing radical expressions for roots of unity

ACM SIGSAM Bulletin • 1996
View 4 Excerpts
Highly Influenced


Publications referenced by this paper.

Rkflexions sur la Rksolution des Prussian Academy , 1770 . S . L ANDAU , Factoring polynomials over algebraic number fields

Mathematical Cuneiform Texts • 1971

Similar Papers

Loading similar papers…