Finding small degree factors of lacunary polynomials

@inproceedings{Lenstra1999FindingSD,
  title={Finding small degree factors of lacunary polynomials},
  author={H. Lenstra},
  year={1999}
}
If K is an algcbraic number field of degree at most m over thc field Q of rational numbers, and / 6 K[X] is a polynomial with dt most k non-zero terms and with /(O) / 0, then for any positive integer d the number of irreducible factors of / m K[X] of degiee at most d, counted with multiplicities, is bounded by a constant that depends only on m, k, and d This is proved m a compamon papei (H W Lenstra Jr "On the factonzation of lacunary polynomials") In the piesent paper an algonthm for actually… Expand
76 Citations
On the factorization of lacunary polynomials
  • 49
Arithmetic Multivariate Descartes' Rule 1
  • PDF
The number of roots of a lacunary bivariate polynomial on a line
  • 14
  • PDF
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields
  • 43
  • PDF
Computing the multilinear factors of lacunary polynomials without heights
  • 1
  • Highly Influenced
  • PDF
On lacunary polynomial perfect powers
  • 9
  • PDF
Factors of Low Individual Degree Polynomials
  • R. Oliveira
  • Mathematics, Computer Science
  • Computational Complexity Conference
  • 2015
  • 1
Efficiently Computing Real Roots of Sparse Polynomials
  • 5
  • PDF
Finiteness for Arithmetic Fewnomial Systems
  • 5
  • PDF
Detecting lacunary perfect powers and computing their roots
  • 9
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Factoring Polynomials Over Algebraic Number Fields
  • 151
  • PDF
Fast Multiple-Precision Evaluation of Elementary Functions
  • R. Brent
  • Mathematics, Computer Science
  • JACM
  • 1976
  • 348
  • PDF