Filaseta, Michael; Schinzel, Andrzej On testing the divisibility of lacunary polynomials by cyclotomic polynomials. (English) Zbl 1099.13519 Math. Comput. 73, No. 246, 957-965 (2004). Summary: 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 coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time. Cited in 10 Documents MSC: 13P05 Polynomials, factorization in commutative rings 12Y05 Computational aspects of field theory and polynomials (MSC2010) 11Y16 Number-theoretic algorithms; complexity 11C08 Polynomials in number theory × Cite Format Result Cite Review PDF Full Text: DOI References: [1] J. H. Conway and A. J. Jones, Trigonometric Diophantine equations (On vanishing sums of roots of unity), Acta Arith. 30 (1976), no. 3, 229 – 240. · Zbl 0349.10014 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.