| ▲ | avd201 3 hours 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. | ||
| ▲ | sashank_1509 a minute ago | parent | next [-] | |
It’s a meaningless improvement | ||
| ▲ | philipwhiuk 2 hours ago | parent | prev [-] | |
My guess is that the constant terms are large enough it's not practically useful in most cases. | ||