Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.symbolic.independent

Topic: a faster "sparse" FFT
Replies: 2   Last Post: Apr 1, 2012 6:00 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Roman Pearce

Posts: 120
Registered: 1/25/05
Re: a faster "sparse" FFT
Posted: Mar 19, 2012 5:48 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Wednesday, March 14, 2012 6:32:39 AM UTC-7, Richard Fateman wrote:
> 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


of course :)



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.