Solvability by radicals from an algorithmic point of view

DOI10.1145/384101.384125zbMath1356.12010OpenAlexW2031838298MaRDI QIDQ2958928

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

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

Related Items

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm