alt Hacker News> The sub O(nlogn) proof for DFT for example violated very old human assumptions.
btw people has massively improved the lower bound (from 1-2^-182 to about 1-2^-10) in the past couple of days: https://github.com/CrocSwap/integer-mult-bounds
> The sub O(nlogn) proof for DFT for example violated very old human assumptions.
btw people has massively improved the lower bound (from 1-2^-182 to about 1-2^-10) in the past couple of days: https://github.com/CrocSwap/integer-mult-bounds