6 citations · 6 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2010★ 6 cited
An in-place truncated Fourier transform and applications to polynomial multiplication
David Harvey, Daniel S. Roche
The truncated Fourier transform (TFT) was introduced by van der Hoeven in 2004 as a means of smoothing the "jumps" in running time of the ordinary FFT algorithm that occur at power…