3 ms·
the past 12 years of algorithm optimizations remove a fator of log(log(n)) from Strassen -- which means multiplying 1million bit numbers is 20x faster, ignorin
by gowld 8y ago
the past 12 years of algorithm optimizations remove a fator of log(log(n)) from Strassen -- which means multiplying 1million bit numbers is 20x faster, ignoring constant factors and cost of cache misses. Constant factors and hardware architecture are still hugely important in choosing the best practical implementations for a problem.