Exact discrete Fourier transform below n log n: exponent saving 1e-13 to 7.3e-5

This project implements an exact discrete Fourier transform with complexity below n log n, saving the exponent from 1e‑13 to 7.3e‑5. It can be adopted in protot