Nearly Optimal Sparse Fourier Transform

Michael Meehan mjmeehan at gmail.com
Tue Feb 7 02:38:19 CET 2012


MIT has a paper out on a new, faster sparse FFT algorithm. Is this
applicable to multiplication in GMP?

http://arxiv.org/abs/1201.2501


More information about the gmp-discuss mailing list