Comment by avd201
1 day ago
Wow, FFT faster than O(nlog(n))? I wonder if that will open the floodgates for further improvement or not. I don't understand anything about most of the fields these results touch, but I can say that this in particular is very surprising.
It’s a meaningless improvement
The applied mathematician’s joke is that log n is bounded above by 45 or so.
My guess is that the constant terms are large enough it's not practically useful in most cases.