NP-Completeness

Sort options

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them (Coursera)

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).

Intro to Theoretical Computer Science (Udacity)

Self Paced
Intro to Theoretical Computer Science (Udacity)
Free Course
Categories
Effort
Languages
Dealing with Challenging Problems. This class teaches you about basic concepts in theoretical computer science -- such as NP-completeness -- and what they imply for solving tough algorithmic problems.