30 citations · 70 across the 24 of their papers we have counts for
Showing 2010 · cs.SCShow all
2 papers · 2 filters
cs.SC2010
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…
cs.SC2010★ 12 cited
Some Results on the Functional Decomposition of Polynomials
Mark Giesbrecht
If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g a…