Commit 0897eb95 authored by Horace He's avatar Horace He

Added links to FFT precision analysis

parent ad1c2ec9
......@@ -13,6 +13,8 @@
Otherwise, use long doubles/NTT/FFTMod.
* Time: O(N \log N) with $N = |A|+|B|$ ($\tilde 1s$ for $N=2^{22}$)
* Status: somewhat tested
* Details: An in-depth examination of precision for both FFT and FFTMod can be found
* here (https://github.com/simonlindholm/fft-precision/blob/master/fft-precision.md)
*/
#pragma once
......
......@@ -8,6 +8,8 @@
* Inputs must be in $[0, \text{mod})$.
* Time: O(N \log N), where $N = |A|+|B|$ (twice as slow as NTT or FFT)
* Status: stress-tested
* Details: An in-depth examination of precision for both FFT and FFTMod can be found
* here (https://github.com/simonlindholm/fft-precision/blob/master/fft-precision.md)
*/
#pragma once
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment