Wednesday, April 29, 2026
9:00 AM-10:30 AM
Hill Conference Room
Lebow Engineering Center, Room 240
31st & Market Streets
Drexel University,
Philadelphia, PA 19104
Matrix multiplication is one of the most basic algebraic operations. Since Strassen's surprising breakthrough algorithm from 1969, which showed that matrices can be multiplied faster than the most straightforward algorithm, algorithmic problems from nearly every scientific domain have been sped up by clever reductions to matrix multiplication. It is popularly conjectured that two n × n matrices can be multiplied in roughly O(n^2) time, but we don't yet have the algorithmic techniques needed to achieve this.
Read More