in 1968 v. strassen discovered the usual way we multiply matrices is not the most efficient one. this raised the question as to just how efficiently matrices can be multiplied, and led to the astounding conjecture that for large matrices, it is almost as easy to multiply them asto add them. after giving a brief history of the problem, i will explain how algebraic geometry and representation theory gives insight into this central question in computer science.