Lec 3 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Loading...
Loading...
51,580
Loading...
There is no Interactive Transcript.
Top Comments
see all
All Comments (20)
-
3:53 me too.
-
very nice teacher.. i like the way it being explained.
-
sooo confusing
-
Nice lecture, but he is always in such a hurry, writes fast and seems stressed it makes me anxious. I want to tell him "chill!!"
5 months ago 2
-
What a damn chalk sound on 47:33
-
20:43 - he could not even explain well enough what fibonacci sequence is.
-
American lectures are like rappers... body language , hand gestures are funny.
-
i can not believe that the naive matrix multiplication can be improved
i do not think there is any waste in the naive algorithm
-
Only in Algebra 2 at my High School, but I think I'm excited to learn algorithms. :)
Loading...
- 23 videosMIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),
- 51:11
Lec 3 | MIT 6.002 Circuits and Electronics, Spring 2007by MIT76,376 views
- 1:20:33
Lec 4 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT47,573 views
- 1:10:31
Lec 2 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT93,505 views
- 1:20:36
Lec 1 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT298,740 views
- 50:16
Lec 8 | MIT 5.112 Principles of Chemical Science, Fall 2005by MIT213,459 views
- 1:49
worst professor everby ugod355399,203 views
- 1:24:33
Lec 17 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT52,137 views
- 9:18
The Most IMPORTANT Video You'll Ever See (part 1 of 8)by wonderingmind424,012,928 views
- 1:16:48
Lec 23 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT8,631 views
- 51:27
Lec 4 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008by MIT83,589 views
- 1:11:00
Lec 15 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005by MIT36,143 views
- 49:09
Lec 1 | MIT 6.035 Computer Language Engineering, Fall 2005by MIT64,913 views
- 1:03:25
Lec 3 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT7,393 views
- 1:09:09
Lec 3 | MIT 8.224 Exploring Black Holesby MIT25,040 views
- 46:13
Lec 8 | MIT 18.02 Multivariable Calculus, Fall 2007by MIT59,972 views
- 1:08:59
Lec 11 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT1,919 views
- 51:05
Lec 3 | MIT 18.02 Multivariable Calculus, Fall 2007by MIT76,230 views
- 56:19
Lec 6 | MIT 8.224 Exploring Black Holesby MIT7,501 views
- 41:50
Lec 3 | MIT 7.014 Introductory Biology, Spring 2005by MIT27,892 views
- 1:07:51
Lec 14 | MIT 6.189 Multicore Programming Primer, IAP 2007by MIT1,610 views
00:24 that's it, I'm fed up with algorithms. I quit.
PolliporeMellite 1 year ago 16
The algorithm he says is "completely impractical" at 54:30 is called the Coppersmith–Winograd algorithm. The running time is O(n^2.376). However, the constant coefficient hidden by the Big O notation is so large that the Coppersmith–Winograd algorithm is only worthwhile for matrices that are too large to handle on present-day computers.
As a side note: Since any algorithm for multiplying two n×n-matrices has to process all 2×n2-entries, there is an asymptotic lower bound of Ω(n^2) operations.
eboyjr14 4 months ago 4