Enigma of NP-Complete Problems
Learn shortest paths: Bellman-Ford, Floyd-Warshall and Johnson Discover the ins and outs of NP-completeness
Want to Crack the Code of Intractability?
Learn strategies for coping with computationally intractable problems (analysis of heuristics, local search).
Master Other Industry Specific Skills
Dynamic Programming Data Structure Algorithms
Learn from Top Experts & Peers
Get the opportunity to learn from Stanford's professors and Computer Science experts.
What's More in Store for You?
Instructor-Moderated Discussions Hands-on Training Capstone Project Case Studies