alt Hacker NewsI already know about fast multiplication algorithms, but it seems there's still no proof that a faster algorithm absolutely cannot exist. In other words, we don't know where the limit is yet.
If that gets proven, would programming multiplication algorithms become faster? I'm curious
Replies
groundzeros2015 • today at 5:49 AM
Matrix multiplication is constantly getting improved but these methods aren’t improvements on practical implementation.
The O(n log n) algorithm is galactic (only becomes more efficient when multiplying massive numbers)
So for numbers we normally work with, no. Maybe with cryptographic operations though.