This repository is not active
robert-king/faster-fast-fourier-transforms
Using dynamic programming and killing entropy, perhaps there's a faster way to do FFT for N < ~10^6
Using dynamic programming and killing entropy, perhaps there's a faster way to do FFT for N < ~10^6
This repository is not active