A Dynamic Programming Algorithm I

Loading...
来自 斯坦福大学 的课程
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
401 评分
斯坦福大学
401 评分
课程 3(共 4 门,Specialization Algorithms
从本节课中
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

与讲师见面

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science