Computation schemes for splitting fields of polynomials

DOI10.1145/1576702.1576741MaRDI QIDQ2883829zbMATH OpenOpenAlexFDO

Authors Guénaël Renault, Kazuhiro Yokoyama, Sébastien Orange

Publication date 13 May 2012

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

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

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Field extensions (12F99) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing splitting fields using Galois theory and other Galois constructions
• Multi-modular algorithm for computing the splitting field of a polynomial
• Computation of the splitting field of a dihedral polynomial
• Sur les relations entre les racines d'un polynôme
• Fast Decomposition of Polynomials with Known Galois Group

Cited in

(9)

• Efficient arithmetic in successive algebraic extension fields using symmetries
• Computing splitting fields using Galois theory and other Galois constructions
• Baby-step giant-step algorithms for the symmetric group
• Computation of the splitting field of a dihedral polynomial
• Splitting algorithm for nilpotent normal forms
• scientific article; zbMATH DE number 2162681 (Why is no real title available?)
• Multi-modular algorithm for computing the splitting field of a polynomial
• scientific article; zbMATH DE number 6471457 (Why is no real title available?)
• Dynamic Galois theory

This page was built for publication: Computation schemes for splitting fields of polynomials

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