
0:00
1:05:53
MIT 6.006 Introduction to Algorithms, Spring 2020Instructor: Erik DemaineView the complete course: https://ocw.mit.edu/6-006S20YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEYUploaded 13-09-21This lecture discusses computational complexity and introduces terminology: P, NP, EXP, R. These terms are applied to the concepts of hardness and completeness. The lecture ends with discussion on reductions. License: Creative Commons BY-NC-SAMore information at https://ocw.mit.edu/termsMore courses at https://ocw.mit.eduSupport OCW at http://ow.ly/a1If50zVRlQWe encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments. Learn more about your ad choices. Visit megaphone.fm/adchoices
Learn more about your ad choices. Visit megaphone.fm/adchoices
Altri episodi di "MIT OpenCourseWare: Free Courses from the institute"



Non perdere nemmeno un episodio di “MIT OpenCourseWare: Free Courses from the institute”. Iscriviti all'app gratuita GetPodcast.








