The second (and much more difficult) part of their conjecture is that N log (N) should be the fundamental speed limit—that no possible multiplication algorithm could do better than this.

But since 10n is equal to 8n+2n, you can express that as a bunch of left shift three times to multiply by eight, adding that value to your original value shifted left once to multiply by two.

They all rely on matrix multiplication for accurate calculations. DeepMind, an artificial intelligence company, recently developed a faster algorithm to conduct matrix multiplications based on deep ...