Until its replacement by the Furer algorithm, the Schonhage-Strassen algorithm was the asymptotically fastest way of doing this to large numbers. One version, sometimes known as "mediation and duplation" and originally found on the Rhind Mathematical Papyrus, involves as one step decomposing a number into powers of two; it's more commonly known as the "peasant" version of this. For matrices, it is
Until its replacement by the Furer algorithm, the Schonhage-Strassen algorithm was the asymptotically fastest way of doing this to large numbers. One version, sometimes known as "mediation and duplation" and originally found on the Rhind Mathematical Papyrus, involves as one step decomposing a number into powers of two; it's more commonly known as the "peasant" version of this. For matrices, it is performed by taking the dot products of the columns of one matrix with the rows of the other. For 10 points, identify this mathematical operation, the inverse of division.
Until its replacement by the Furer algorithm, the Schonhage-Strassen algorithm was the asymptotically fastest way of doing this to large numbers.
{multiplication} [accept word forms, apologize for sketchy question]