Solvability by radicals from an algorithmic point of view

DOI10.1145/384101.384125MaRDI QIDQ2958928zbMATH OpenOpenAlexFDO

Authors Guillaume Hanrot, François Morain

Publication date 3 February 2017

Published in Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00072522/file/RR-4109.pdf

Mathematics Subject Classification ID

Separable extensions, Galois theory (12F10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Solvability by radicals is in polynomial time
• Fast Decomposition of Polynomials with Known Galois Group
• Galois theory and solvable equations of prime degree
• scientific article; zbMATH DE number 2157061
• scientific article; zbMATH DE number 2151221

Cited in

(7)

• Solvability by radicals is in polynomial time
• A strong and easily computable separation bound for arithmetic expressions involving radicals
• Variations on the theme of solvability by radicals
• Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
• scientific article; zbMATH DE number 2151221 (Why is no real title available?)
• scientific article; zbMATH DE number 2094658 (Why is no real title available?)
• One class of equations solvable in radicals

This page was built for publication: Solvability by radicals from an algorithmic point of view

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958928)