NP-completeness Courses
Stanford University via Coursera Intro to Theoretical Computer Science
Udacity 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Introduction to Graduate Algorithms
Georgia Institute of Technology via Udacity Algorithms: Design and Analysis, Part 2
Stanford University via edX Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Dynamic Programming, Greedy Algorithms, and Intractability
University of Colorado Boulder via Coursera Computational Complexity
IIT Hyderabad via Swayam