Detecting lacunary perfect powers and computing their roots

DOI10.1016/j.jsc.2011.08.006zbMath1233.13011OpenAlexW2114412781MaRDI QIDQ650838

Daniel S. Roche, Mark W. Giesbrecht

Publication date: 7 December 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.08.006

zbMATH Keywords

sparse polynomiallacunary representationperfect power

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials in number theory (11C08) Polynomials, factorization in commutative rings (13P05)

Related Items (1)

Computing the multilinear factors of lacunary polynomials without heights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interpolation of polynomials given by straight-line programs
• New NP-hard and NP-complete polynomial and integer divisibility problems
• On fast multiplication of polynomials over arbitrary algebras
• Sparse complex polynomials and polynomial reducibility
• A polynomial time algorithm for diophantine equations in one variable
• Early termination in sparse interpolation algorithms
• Sieve algorithms for perfect power testing
• Approximate formulas for some functions of prime numbers
• Sparse squares of polynomials
• Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
• Polynomials whose powers are sparse
• On the number of terms of a composite polynomial
• Factoring Polynomials over Algebraic Number Fields
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• An Inequality About Factors of Polynomials
• Detecting perfect powers in essentially linear time
• Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications
• Counting curves and their projections
• On lacunary polynomial perfect powers
• On Some Exponential Sums
• On the number of terms of a power of a polynomial
• Fast construction of irreducible polynomials over finite fields

This page was built for publication: Detecting lacunary perfect powers and computing their roots