Mastering Time Complexity: Key Concepts from CMU's 15-251 Spring 2016 Lecture π
Explore essential ideas in theoretical computer science with Ryan O'Donnell's lecture on Time Complexity from CMU's 15-251 course. Perfect for deepening your understanding of algorithm efficiency!
Ryan O'Donnell
1.7K views β’ Jul 16, 2017
About this video
CMU 15-251: Great Ideas in Theoretical Computer Science
Spring 2016 Lecture #7: Time Complexity
http://www.cs.cmu.edu/~15251/
Taught by Ryan O'Donnell
(http://www.cs.cmu.edu/~odonnell)
Filmed by Panopto (http://www.panopto.com/)
Spring 2016 Lecture #7: Time Complexity
http://www.cs.cmu.edu/~15251/
Taught by Ryan O'Donnell
(http://www.cs.cmu.edu/~odonnell)
Filmed by Panopto (http://www.panopto.com/)
Video Information
Views
1.7K
Likes
9
Duration
01:17:08
Published
Jul 16, 2017
User Reviews
4.0
(1) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
No specific trending topics match this video yet.
Explore All Trends