Knapsack via Dynamic Programming, Revisited

Loading...
From the course by 斯坦福大学
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
247 ratings
斯坦福大学
247 ratings
Course 4 of 4 in the Specialization Algorithms

Meet the Instructors

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science