Factoring polynomials over p-adic fields

DOI10.1007/10722028_10MaRDI QIDQ2739443zbMATH OpenFDO

Authors David G. Cantor, Daniel M. Gordon

Publication date 12 March 2003

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

Full work available at URL https://doi.org/10.1007/10722028_10

zbMATH Keywords

factoring polynomialsfinite algebraic extensions of the \(p\)-adic numbers

Mathematics Subject Classification ID

Polynomials (11S05) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Factoring polynomials over local fields.
• Factoring polynomials over global fields. I
• An efficient algorithm for factoring polynomials over algebraic extension field
• scientific article; zbMATH DE number 3858405

Cited in

(30)

• A fast algorithm for polynomial factorization over \(\mathbb Q_p\)
• Zero testing of \(p\)-adic and modular polynomials
• Efficient \(p\)-adic cell decompositions for univariate polynomials
• On the bit complexity of polynomial system solving
• Root repulsion and faster solving for very sparse polynomials over \(p\)-adic fields
• Efficiently factoring polynomials modulo \(p^4\)
• Division and slope factorization of p-adic polynomials
• Factoring formal power series over principal ideal domains
• Erratum: Factoring Polynomials over Algebraic Number Fields
• An efficient algorithm for factoring polynomials over algebraic extension field
• scientific article; zbMATH DE number 3897063 (Why is no real title available?)
• Factoring with Cyclotomic Polynomials
• Faster p-adic feasibility for certain multivariate sparse polynomials
• scientific article; zbMATH DE number 1254268 (Why is no real title available?)
• Single-factor lifting and factorization of polynomials over local fields
• Factoring polynomials over local fields. II
• Counting basic-irreducible factors \(\operatorname{mod} p^k\) in deterministic poly-time and \(p\)-adic applications
• Randomized polynomial-time root counting in prime power rings
• Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
• Factoring polynomials over local fields.
• An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
• Pourchet’s theorem in action: decomposing univariate nonnegative polynomials as sums of five squares
• Counting roots for polynomials modulo prime powers
• Solving polynomial systems over non-fields and applications to modular polynomial factoring
• A complexity chasm for solving univariate sparse polynomial equations over p-adic fields
• Polynomial factorization: Sharp bounds, efficient algorithms
• Plane curve germs and contact factorization
• Computing the local group of prime-power classes
• Toward a theory of Pollard's rho method
• Fast arithmetic in unramified \(p\)-adic fields

This page was built for publication: Factoring polynomials over \(p\)-adic fields

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