A fast algorithm for polynomial factorization over \(\mathbb Q_p\)

DOI10.5802/JTNB.351zbMath1032.11053OpenAlexW2317126969MaRDI QIDQ1396437

D. Massart

Publication date: 30 June 2003

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=JTNB_2002__14_1_151_0

zbMATH Keywords

polynomial factorization\(p\)-adic integers

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials (11S05)

Related Items (15)

RAMIFICATION POLYGONS, SPLITTING FIELDS, AND GALOIS GROUPS OF EISENSTEIN POLYNOMIALS ⋮ A relative van Hoeij algorithm over number fields ⋮ Polynomial factorization algorithms over number fields ⋮ Single-factor lifting and factorization of polynomials over local fields ⋮ On small discriminants of number fields of degree 8 and 9 ⋮ Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields ⋮ Higher Newton polygons and integral bases ⋮ Newton polygons of higher order in algebraic number theory ⋮ Complexity of OM factorizations of polynomials over local fields ⋮ On the Complexity of the Montes Ideal Factorization Algorithm ⋮ Factoring Polynomials over Local Fields II ⋮ Topics in computational algebraic number theory ⋮ Fast integral bases computation ⋮ Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings ⋮ Two-periodic dynamics in finite extensions of the \(p\)-adic number field

Cites Work

• Unnamed Item
• Unnamed Item
• An \(\widehat{A_4}\) extension of \({\mathbb{Q}}\) attached to a non-selfdual automorphic form on \(GL(3)\)
• Implementing the Round Four maximal order algorithm
• Factoring polynomials over local fields.

This page was built for publication: A fast algorithm for polynomial factorization over \(\mathbb Q_p\)