Abstract
In this paper we present several polynomial time algorithms for Galois groups. We show: (i) There are polynomial time algorithms to determine: (a) If the Galois group of an irreducible polynomial over Q is a p-group. (b) the prime divisors of the order of a solvable Galois group (ii) Using the classification theorem for finite simple groups, there is a polynomial time algorithm to determine whether an irreducible polynomial over Q has Galois group Sn or An.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
