30 citations · 70 across the 24 of their papers we have counts for
3 papers · 1 filter
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…
Composition collisions and projective polynomials
Joachim von zur Gathen, Mark Giesbrecht, Konstantin Ziegler
The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of…
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…