Lecture 3: Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
recorded by: Massachusetts Institute of Technology, MIT
published: Feb. 10, 2009, recorded: September 2005, views: 54167
released under terms of: Creative Commons Attribution Non-Commercial Share Alike (CC-BY-NC-SA)
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
"Good morning everyone. Today we are going to do some algorithms, back to algorithms, and we are going to use a lot of the, well, some of the simpler mathematics that we developed last class like the master theorem for solving recurrences. We are going to use this a lot. Because we are going to talk about recursive algorithms today. And so we will find their running time using the master theorem. This is just the same as it was last time, I hope, unless I made a mistake. A couple of reminders. You should all go to recitation on Friday. That is required. If you want to, you can go to homework lab on Sunday. That may be a good excuse for you to actually work on your problem set a few hours early...
Download slides: mit6046jf05_demaine_lec03_01.pdf (327.3 KB)
Download mit6046jf05_demaine_lec03_01.m4v (Video - generic video source 143.2 MB)
Download mit6046jf05_demaine_lec03_01.rm (Video - generic video source 109.7 MB)
Download mit6046jf05_demaine_lec03_01.flv (Video 191.0 MB)
Download mit6046jf05_demaine_lec03_01.wmv (Video 591.4 MB)
Download mit6046jf05_demaine_lec03_01.mp3 (Audio lecture 15.8 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !