activity
20072011
most citedNear NP-Completeness for Detecting p-adic Rational Roots in One Variable

3 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing 2010Show all

2 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.NT2010★ 3 cited

Near NP-Completeness for Detecting p-adic Rational Roots in One Variable

Martin Avendano, Ashraf Ibrahim, J. Maurice Rojas +1

We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomial…