On Computing Galois Groups and Its Application To Solvability by Radicals
Name
MIT-LCS-TR-288.pdf
Size
2.63 MB
Format
Adobe PDF
Checksum (MD5)
34998733d6087d4c19e493dd705321fa
Author(s)
Laudau, Susan Eva
Advisor(s)
Miller, Gary L.
Date Issued
March 1983
Series/Report no.
MIT-LCS-TR-288
Abstract
This thesis presents a polynomial time algorithm for the basic question of Galois theory, checking the solvability by radicals of a monic irreducible polynomial over the integers. It also presents polynomial time algorithms for factoring polynomials over algebraic number fields, for computing blocks of imprimitivity of roots of a polynomial under the transitive action of the Galois group on the roots of the polynomial, and for computing intersections algebraic number fields.
Persistent DSpace Link
