Skip to content
lectern.tv
1/5

R1. Matrix Multiplication and the Master Theorem

Erik Demaine & Srini DevadasMIT

Professors of Computer Science

53:46·2016·undergraduate level

This recitation reviews dynamic programming via Weighted Interval Scheduling, introduces Strassen's algorithm for matrix multiplication, and rigorously applies the Master Theorem to analyze recursive algorithm complexities.

Theory & AlgosAlgorithms & Data StructuresDynamic ProgrammingStrassen AlgorithmDivide and Conquer

MIT 6.046J Design and Analysis of Algorithms, Spring 2015

View the complete course: http://ocw.mit.edu/6-046JS15

Instructor: Ling Ren

Previous · Lecture 2

2. Divide & Conquer: Convex Hull, Median Finding

Next · Lecture 4

3. Divide & Conquer: FFT

Discussion

0
Join the discussion — share questions, derivations, or timestamped notes.Sign in to comment
No comments on this lecture yet. Start the discussion above.