Factoring polynomials over local fields.

DOI10.1006/jsco.2001.0493zbMath1085.12500OpenAlexW2023200896MaRDI QIDQ5950986

Sebastian Pauli

Publication date: 2 January 2002

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

Full work available at URL: https://doi.org/10.1006/jsco.2001.0493

Mathematics Subject Classification ID

Related Items (14)

Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Computing with quadratic forms over number fields ⋮ Factoring formal power series over principal ideal domains ⋮ A solution to certain polynomial equations with applications to nonlinear fitting ⋮ A fast algorithm for polynomial factorization over \(\mathbb Q_p\) ⋮ Efficient computation of maximal orders in radical (including Kummer) extensions ⋮ Single-factor lifting and factorization of polynomials over local fields ⋮ Variation of the reduction type of elliptic curves under small base change with wild ramification ⋮ Higher Newton polygons and integral bases ⋮ Complexity of OM factorizations of polynomials over local fields ⋮ On the Complexity of the Montes Ideal Factorization Algorithm ⋮ Factoring Polynomials over Local Fields II ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings ⋮ Computing canonical heights using arithmetic intersection theory

Uses Software

• Magma

Cites Work

• The construction of maximal orders over a Dedekind domain
• Implementing the Round Four maximal order algorithm
• Fast multiplication of large numbers
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Asymptotically Fast Triangularization of Matrices over Rings
• Subquadratic-time factoring of polynomials over finite fields
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factoring polynomials over local fields.