Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the theoretical and practical aspects of comparing algorithms for matrix-matrix multiplication, including the number of arithmetic operations and hidden constants. It explores the significance of fast matrix-matrix multiplication algorithms like Strassen's method and Coppersmith-Winograd algorithm, detailing their operation and historical development. The lecture also delves into the importance of matrix-matrix multiplication in various fields, such as linear algebra and optimization, showcasing its fundamental role and diverse applications throughout computer science.