Proof of Optimal Substructure

Loading...
Del curso dictado por Universidad de Stanford
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
400 ratings
Universidad de Stanford
400 ratings
Curso 3 de 4 en SpecializationAlgorithms
De la lección
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

Conoce a los instructores

  • Tim Roughgarden
    Tim Roughgarden
    Professor
    Computer Science