On testing the divisibility of lacunary polynomials by cyclotomic polynomials

@article{Filaseta2004OnTT,
title={On testing the divisibility of lacunary polynomials by cyclotomic polynomials},
author={Michael Filaseta and Andrzej Schinzel},
journal={Math. Comput.},
year={2004},
volume={73},
pages={957-965}
}

An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficientexponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.