Definition and Interpretation of NP-Completeness I

Loading...
From the course by Stanford University
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
174 ratings
Stanford University

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

174 ratings
Course 4 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
Download on the App StoreGet it on Google Play