Computing sparse multiples of polynomials

Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists…