A modular method for computing the Galois groups of polynomials

DOI10.1016/S0022-4049(97)00030-3zbMath0887.11047MaRDI QIDQ1358933

Kazuhiro Yokoyama

Publication date: 10 May 1998

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmsliftingGalois grouppolynomials

Mathematics Subject Classification ID

Galois theory (11R32) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (8)

A parallel multi-modular algorithm for computing Lagrange resolvents ⋮ Gröbner basis of the alternating Galoisian ideal ⋮ Efficient arithmetic in successive algebraic extension fields using symmetries ⋮ Using Galois ideals for computing relative resolvents ⋮ Galois group computation for rational polynomials ⋮ Special issue: Algorithmic methods in Galois theory ⋮ Exact algorithms for \(p\)-adic fields and epsilon constant conjectures ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)

Uses Software

• Maple

Cites Work

• Computing Galois groups over the rationals
• Fundamental algorithms for permutation groups
• Computational verification of M₁₁and M₁₂as galois groups over Q
• On Invariant Polynomials and Their Application in Field Theory
• Deux propriétés décidables des suites récurrentes linéaires
• Factoring Polynomials Over Algebraic Number Fields
• The Determination of Galois Groups
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A modular method for computing the Galois groups of polynomials