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

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This repository is not active

About

Using dynamic programming and killing entropy, perhaps there's a faster way to do FFT for N < ~10^6