We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and positive integer r, and of finding …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

On Lacunary Polynomial Perfect Powers Page 1 Lacunary Polynomials Our Algorithm Why it
Works Implementation Computing the Root On Lacunary Polynomial Perfect Powers Mark …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …

We consider the problem of determining whether a t-sparse or lacunary polynomial f is a
perfect power, that is, f= hr for some other polynomial h and r∈ N, and of finding h and r …