| ▲ | kingstnap 4 hours ago | |||||||
Yeah its ridiculously small, but any improvement on n log n is wild. Like there is somehow redundancy in a fourier transform that makes it sub Linearithmic? Which low and behold -> 130. Fourier transforms below n log n. | ||||||||
| ▲ | xyzzyz 4 hours ago | parent [-] | |||||||
They also separately give algorithm for Fourier transform over complex number faster than O(n log n) | ||||||||
| ||||||||