Complexity of OM factorizations of polynomials over local fields

DOI10.1112/S1461157013000089zbMath1343.11099arXiv1204.4671OpenAlexW2964275962WikidataQ114077764 ScholiaQ114077764MaRDI QIDQ5169597

Jens-Dietrich Bauch, Hayden D. Stainsby, Enric Nart Viñals

Publication date: 11 July 2014

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.4671

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Valuation rings (13F30) Factorization (11Y05) Valued fields (12J10) Solving polynomial systems; resultants (13P15)

Related Items (9)

Computation of integral bases ⋮ A quasi-linear irreducibility test in \(\mathbb{K}x[y\)] ⋮ Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields ⋮ A new computational approach to ideal theory in number fields ⋮ Computation of triangular integral bases ⋮ Higher Newton polygons and integral bases ⋮ Local computation of differents and discriminants ⋮ Genus computation of global function fields ⋮ Computing zeta functions of algebraic curves using Harvey's trace formula

Cites Work

• Unnamed Item
• 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
• Okutsu-Montes representations of prime ideals of one-dimensional integral closures
• Construction of integral basis. II
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Fast multiplication of large numbers
• A construction for prime ideals as absolute values of an algebraic field
• Okutsu invariants and Newton polygons
• Newton polygons of higher order in algebraic number theory
• Factoring polynomials over local fields.

This page was built for publication: Complexity of OM factorizations of polynomials over local fields