Detecting lacunary perfect powers and computing their roots (2009)

by Mark Giesbrecht , Daniel S. Roche
Citations:3 - 0 self

Documents Related by Co-Citation

18 Finding small degree factors of lacunary polynomials – H W Lenstra - 1999
15 A Polynomial Time Algorithm for Diophantine Equations in One Variable – Felipe Cucker, Pascal Koiran, Steve Smale - 1999
9 Interpolation of Shifted-Lacunary Polynomials [Extended Abstract] – Mark Giesbrecht, Daniel S. Roche
2 On primes in arithmetic progressions – H Mikawa
1 Unpublished article fragment – E Kaltofen - 1988
3 On Lacunary Polynomial Perfect Powers – M Giesbrecht, D Roche
3 Fifteen years after DSC and WLSS2 what parallel computations I do today – E Kaltofen - 2010
4 Interpolation of polynomials given by straight-line – Sanchit Garg, Éric Schost
10 Algorithms for Computing the Sparsest Shifts of Polynomials Via The . . . – Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee - 2002
12 On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms – Erich Kaltofen, Zhengfeng Yang, et al. - 2007
7 On exact and approximate interpolation of sparse rational functions – E Kaltofen, Z Yang
6 The vector rational function reconstruction problem – Zach Olesh, Arne Storjohann - 2006
2 Computing sparse multiples of polynomials – M Giesbrecht, D S Roche, H Tilak - 2010
5 Irreducibility and greatest common divisor algorithms for sparse polynomials – Michael Filaseta, Andrew Granville, Andrzej Schinzel - 2008
39 New NP-hard and NP-complete polynomial and integer divisibility problems – D A Plaisted - 1984
51 Greatest Common Divisors of Polynomials Given by Straight-Line Programs – Erich Kaltofen - 1988
35 Zero-free regions for dirichlet l-functions, and the least prime in an arithmetic progression – D R Heath-Brown - 1992
16 Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields – E Kaltofen, P Koiran
9 Almost-primes in arithmetic progressions and short intervals – D R Heath-Brown - 1978