Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



a faster "sparse" FFT
Posted:
Mar 14, 2012 9:32 AM


http://arxiv.org/abs/1201.2501v1
This might be especially nice for dealing with sparse polynomial arithmetic via FFT. I haven't studied it yet, but has anyone in the sci.math.symbolic readership looked?
RJF



