Concept of NP - Compliteness in Design and Analysis of Algorithms - Video Lecture

Prof.Sunder Vishwanathan, Department of Computer Science and Engineering, IIT Bombay explained the concept of NP-Completeness in Design and Analysis of Algorithms. Feel free to ask your doubts and please contribute your views here...



[video=youtube;76n4BjlL1cs]https://www.youtube.com/watch?v=76n4BjlL1cs&feature=player_embedded[/video]


[video=youtube;bE4d4IiOEQk]https://www.youtube.com/watch?v=bE4d4IiOEQk&feature=player_embedded[/video]


[video=youtube;eOrxeu3GNrI]https://www.youtube.com/watch?v=eOrxeu3GNrI&feature=player_embedded[/video]


[video=youtube;8Rlh-95PJa4]https://www.youtube.com/watch?v=8Rlh-95PJa4&feature=player_embedded[/video]



[video=youtube;DBdBEziisrY]https://www.youtube.com/watch?v=DBdBEziisrY&feature=player_embedded[/video]