In linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, was the asymptotically fastest known algorithm for square matrix multiplication until 2010.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schönhage–Strassen algorithm | Luhn algorithm | Earley's Algorithm | Don Coppersmith | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | Vic Coppersmith-Heaven | sorting algorithm | Root-finding algorithm | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm | Vatti clipping algorithm | Sorting algorithm | Secure Hash Algorithm (disambiguation) | Schoof's algorithm | Schoof–Elkies–Atkin algorithm |
Workshop of a coppersmith in Cloppenburg; the oldest units are from the period around 1850