Dive into advanced algorithm design and analysis techniques in this Stanford University course. Explore topics like dynamic programming, linear programming, NP-completeness, and approximation algorithms over 4 hours of weekly study. Enhance your problem-solving skills and gain a deeper understanding of complex algorithmic concepts essential for tackling real-world computational challenges.
Algorithms: Design and Analysis, Part 2
Stanford University via Stanford OpenEdx
-
356
-
- Write review
This course may be unavailable.
Overview
Taught by
Tim Roughgarden