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 concept of divide-and-conquer in matrix multiplication, starting with recursion trees and the master method for solving recurrences. It then delves into the maximum-subarray problem and the smart algorithm for matrix multiplication. The divide-and-conquer algorithm is explained, showing how matrices are divided and conquered to optimize the multiplication process.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace