In long multiplication, we have to multiply every digit of the first number by every digit of the second number. If the two numbers each have N digits, that's N 2 (or N x N ) multiplications ...

For example, multiplying two 4×4 matrices together using a traditional schoolroom method would take 64 multiplications, while Strassen's algorithm can perform the same feat in 49 multiplications.

The new method, called Linear-Complexity Multiplication (L-Mul), comes close to the results of FPM while using the simpler algorithm. But despite that, it’s still able to maintain the high ...

To this end, [Ken Shirriff] set about reverse engineering the 8086’s multiplication algorithm. [Ken]’s efforts were achieved by using die photos of the 8086 chip.