Analysis of a Greedy Knapsack Heuristic I

Loading...

您将学习的技能

Data Structure, Algorithms, Np-Completeness, Dynamic Programming

审阅

4.8(452 个评分)
  • 5 stars
    386 ratings
  • 4 stars
    58 ratings
  • 3 stars
    5 ratings
  • 2 stars
    2 ratings
  • 1 star
    1 ratings
JF

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

LL

May 02, 2018

Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!

教学方

  • Tim Roughgarden

    Tim Roughgarden

    Professor

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。