Detecting lacunary perfect powers and computing their roots
From MaRDI portal
Publication:650838
DOI10.1016/J.JSC.2011.08.006zbMATH Open1233.13011OpenAlexW2114412781MaRDI QIDQ650838FDOQ650838
Authors: Daniel S. Roche, Mark 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
Recommendations
- On lacunary polynomial perfect powers
- Detecting perfect powers in essentially linear time
- An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity
- Lacunaryx: computing bounded-degree factors of lacunary polynomials
- Computing the multilinear factors of lacunary polynomials without heights
Polynomials in number theory (11C08) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials, factorization in commutative rings (13P05)
Cites Work
- Title not available (Why is that?)
- On fast multiplication of polynomials over arbitrary algebras
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On Some Exponential Sums
- Early termination in sparse interpolation algorithms
- Title not available (Why is that?)
- Approximate formulas for some functions of prime numbers
- Factoring Polynomials over Algebraic Number Fields
- Fast construction of irreducible polynomials over finite fields
- Interpolation of polynomials given by straight-line programs
- Title not available (Why is that?)
- New NP-hard and NP-complete polynomial and integer divisibility problems
- Title not available (Why is that?)
- A polynomial time algorithm for diophantine equations in one variable
- Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
- Title not available (Why is that?)
- Polynomials whose powers are sparse
- Sparse complex polynomials and polynomial reducibility
- Sieve algorithms for perfect power testing
- Sparse squares of polynomials
- On the number of terms of a composite polynomial
- An Inequality About Factors of Polynomials
- Detecting perfect powers in essentially linear time
- Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications
- Title not available (Why is that?)
- Counting curves and their projections
- On lacunary polynomial perfect powers
- On the number of terms of a power of a polynomial
Cited In (5)
This page was built for publication: Detecting lacunary perfect powers and computing their roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650838)
