4 ms·
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 crypto
by TimTheTinker 3mo ago
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.
- jason_s 3mo agoEven crypto isn't that large: 2^4096 is kind of the norm here. Some mathematical researchers are working in the million, billion, or even trillion-bit range.