Solvability by radicals is in polynomial time

DOI10.1016/0022-0000(85)90013-3zbMath0586.12002OpenAlexW1976456789WikidataQ55967929 ScholiaQ55967929MaRDI QIDQ1071803

Susan Landau, Gary Lee Miller

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90013-3

zbMATH Keywords

polynomialpolynomial timeLenstra-Lenstra-Lovász algorithmsolvable Galois groupsolvable in radicals

Mathematics Subject Classification ID

Related Items (27)

The inapproximability of lattice and coding problems with preprocessing ⋮ Automatic constructibility checking of a corpus of geometric construction problems ⋮ How to tangle with a nested radical ⋮ Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems ⋮ Polynomial factorization algorithms over number fields ⋮ Algorithms in Algebraic Number Theory ⋮ Block Systems of a Galois Group ⋮ Compositions and collisions at degree \(p^2\) ⋮ Polynomial decomposition algorithms ⋮ On the mechanization of straightedge and compass constructions ⋮ Computation of unirational fields ⋮ Computational complexity of sentences over fields ⋮ A note on ``Zippel denesting ⋮ Polynomial time algorithms for sentences over number fields ⋮ Counting invariant subspaces and decompositions of additive polynomials ⋮ Galois group computation for rational polynomials ⋮ La réduction des réseaux. Autour de l'algorithme de Lenstra, Lenstra, Lovász ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms ⋮ Solving degenerate sparse polynomial systems faster ⋮ Tame decompositions and collisions ⋮ \(\sqrt{2}+\sqrt{3}\): Four different views ⋮ Sentences over integral domains and their computational complexities ⋮ On computing subfields. A detailed description of the algorithm ⋮ Computing groups of Hecke characters ⋮ General formulas for solving solvable sextic equations ⋮ Solving polynomials by radicals with roots of unity in minimum depth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• A polynomial bound for the orders of primitive solvable groups
• Zur pythagoreischen Algebra: Quadratwurzel und Kubikwurzel
• Factoring Polynomials over Algebraic Number Fields
• Some Remarks on Computing Galois Groups
• Finite Permutation Groups and Finite Simple Groups
• An Algorithm for Finding the Blocks of a Permutation Group
• Factoring Polynomials Over Algebraic Number Fields
• The Determination of Galois Groups
• Systems of distinct representatives and linear algebra

This page was built for publication: Solvability by radicals is in polynomial time