Factoring Polynomials over Local Fields II

DOI10.1007/978-3-642-14518-6_24zbMath1260.12005OpenAlexW1600941563MaRDI QIDQ4931656

Sebastian Pauli

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14518-6_24

zbMATH Keywords

Montes algorithmZassenhaus Round Four algorithm

Mathematics Subject Classification ID

Related Items (7)

Computing with quadratic forms over number fields ⋮ A new computational approach to ideal theory in number fields ⋮ Enumerating extensions of (π)-adic fields with given invariants ⋮ Single-factor lifting and factorization of polynomials over local fields ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Local computation of differents and discriminants ⋮ Okutsu-Montes representations of prime ideals of one-dimensional integral closures

Cites Work

• Unnamed Item
• Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
• On a theorem of Ore
• Implementing the Round Four maximal order algorithm
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Fast multiplication of large numbers
• Subquadratic-time factoring of polynomials over finite fields
• On the Complexity of the Montes Ideal Factorization Algorithm
• Newton polygons of higher order in algebraic number theory
• A Construction for Absolute Values in Polynomial Rings
• Factoring polynomials over local fields.

This page was built for publication: Factoring Polynomials over Local Fields II