Multi-modular algorithm for computing the splitting field of a polynomial

DOI10.1145/1390768.1390803MaRDI QIDQ5301630zbMATH OpenOpenAlexFDO

Authors Guénaël Renault, Kazuhiro Yokoyama

Publication date 20 January 2009

Published in Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1390768.1390803

Mathematics Subject Classification ID

Algebraic field extensions (12F05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Algorithmic Number Theory
• Computation schemes for splitting fields of polynomials
• Computation of the splitting field of a dihedral polynomial
• Computing splitting fields using Galois theory and other Galois constructions
• A fast and stable algorithm for splitting polynomials

Cited in

(7)

• Usage of modular techniques for efficient computation of ideal operations
• Computing splitting fields using Galois theory and other Galois constructions
• Computation schemes for splitting fields of polynomials
• Computation of the splitting field of a dihedral polynomial
• Algorithmic Number Theory
• Dynamic Galois theory
• Gröbner basis of the alternating Galoisian ideal

This page was built for publication: Multi-modular algorithm for computing the splitting field of a polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301630)