This resulted in the discovery of algorithms that multiply large matrices 10–20% faster than those commonly used on that piece of hardware.

More generally, the product of a pair of n -by- n matrices is another n -by- n matrix with n2 entries. For this reason, the fastest one could possibly hope to multiply pairs of matrices is in n2 steps ...