Hacker News new | ask | show | jobs
by oasisaimlessly 140 days ago
That argument could also be used to say that the FFT's time complexity of O(n log n) should be impossible.