Indexed metadata
On testing the divisibility of lacunary polynomials by cyclotomic polynomials
Michael Filaseta, Andrzej Schinzel
Source record
Source: Crossref
Published: Aug 5, 2003
DOI: 10.1090/s0025-5718-03-01589-8
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.