108 citations · 310 across the 26 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
Chunky and Equal-Spaced Polynomial Multiplication
Daniel S. Roche
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead empl…