Computing Rational Zeros of Integral Polynomials by p-Adic Expansion

DOI10.1137/0212017MaRDI QIDQ3321471zbMATH OpenOpenAlexFDO

Authors Rüdiger Loos

Publication date 1983

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0212017

zbMATH Keywords

Newton-Hensel algorithmp-adic expansionpolynomial factorizationquadratic Hensel liftingrational zeros of integral polynomialrational zeros of univariate polynomials

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Algebraic number theory: local fields (11S99) Numerical computation of solutions to single equations (65H05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Exact computation of polynomial zeros expressible by square roots
• Algorithms and Computation
• scientific article; zbMATH DE number 2177636
• scientific article; zbMATH DE number 3846864
• Computers and the Multiplicity of Polynomial Roots

Cited in

(7)

• Interpolation of polynomials given by straight-line programs
• Distances from differences of roots of polynomials to the nearest integers
• Algorithms, complexity and discreteness criteria in \(PSL(2,C)\)
• Efficient \(p\)-adic cell decompositions for univariate polynomials
• Computing the rational torsion of an elliptic curve using Tate normal form.
• Sparse shifts for univariate polynomials
• A deterministic algorithm for finding \(r\)-power divisors

This page was built for publication: Computing Rational Zeros of Integral Polynomials by p-Adic Expansion

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