4 citations · 6 across the 5 of their papers we have counts for
Showing math.NTShow all
3 papers · 1 filter
math.NT2010★ 2 cited
Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials
Martín Avendaño, Ashraf Ibrahim, J. Maurice Rojas +1
We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that…
math.NT2006
Factoring bivariate sparse (lacunary) polynomials
Martin Avendano, Teresa Krick, Martin Sombra
We present a deterministic algorithm for computing all irreducible factors of degree of a given bivariate polynomial over an algebraic number field and th…
math.NT2005
Newton-Hensel Interpolation Lifting
Martin Avendaño, Teresa Krick, Ariel Pacetti
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in from information modulo…