Chevron Left
Back to Dynamic Programming, Greedy Algorithms, and Intractability

Learner Reviews & Feedback for Dynamic Programming, Greedy Algorithms, and Intractability by University of Colorado Boulder

About the Course

This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures....
Filter by: