Computational Group Theory


Volume 174 of the series Lecture Notes in Computer Science pp 225-236


Polynomial time algorithms for Galois groups

  • Susan LandauAffiliated withMath Department, Wesleyan University

* Final gross prices may vary according to local VAT.

Get Access


In this paper we present several polynomial time algorithms for Galois groups. We show:
  1. (i)

    There are polynomial time algorithms to determine:

  1. (a)

    If the Galois group of an irreducible polynomial over Q is a p-group.

  2. (b)

    the prime divisors of the order of a solvable Galois group

  3. (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.


We consider several techniques for computing Galois groups, including the Chebatorev Density Theorem, and their applicability to polynomial time computations.