A parallel multi-modular algorithm for computing Lagrange resolvents

DOI10.1016/S0747-7171(02)00012-3zbMath1137.12302MaRDI QIDQ2643525

Nicolas Rennert

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmLagrange resolvents

Mathematics Subject Classification ID

Related Items (4)

PARALLEL COMPUTATION OF RESOLVENTS BY MULTIMODULAR TECHNIQUES AND DECOMPOSITION FORMULA ⋮ ON THE FIELD INTERSECTION PROBLEM OF SOLVABLE QUINTIC GENERIC POLYNOMIALS ⋮ On the simplest sextic fields and related Thue equations ⋮ On the Simplest Quartic Fields and Related Thue Equations

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modular method for computing the Galois groups of polynomials
• Study of algebraic relations between the roots of a univariate polynomial
• The transitive groups of degree up to eleven⁺
• Symmetric Functions, m-Sets, and Galois Groups
• The Determination of Galois Groups
• Calcul de résolvantes avec les modules de Cauchy
• Lagrange resolvents
• Using Galois ideals for computing relative resolvents

This page was built for publication: A parallel multi-modular algorithm for computing Lagrange resolvents