The O(n log n) algorithm is galactic (only becomes more efficient when multiplying massive numbers)
replySo for numbers we normally work with, no. Maybe with cryptographic operations though.
Even crypto isn't that large: 2^4096 is kind of the norm here.
replySome mathematical researchers are working in the million, billion, or even trillion-bit range.
Matrix multiplication is constantly getting improved but these methods aren’t improvements on practical implementation.
reply