On Computing Galois Groups and Its Application To Solvability by Radicals
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 block...
Main Author: | Laudau, Susan Eva |
---|---|
Other Authors: | Miller, Gary L. |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149566 |
Similar Items
-
Solvable absolute Galois groups are metabelian
by: Koenigsmann, J
Published: (2001) -
Advances course in modern algebra : a complete study of modern algebra including galois theory, solvable groups, modules /
by: 391553 Goyal, J. K., et al.
Published: (1975) -
Galois groups and their representations /
by: Ihara, Y.
Published: (1983) -
Galois' dream : group theory and differential equations /
by: 351830 Michio Kuga, et al.
Published: (1993) -
An isomorphism of motivic Galois groups
by: Choudhury, U, et al.
Published: (2017)