Definition and Interpretation of NP-Completeness I

Loading...
Del curso dictado por Universidad de Stanford
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
249 ratings
Universidad de Stanford
249 ratings
Curso 4 de 4 en SpecializationAlgorithms

Conoce a los instructores

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science