Introduction to efficient algorithm design paradigms and analysis of computational intractability.
Offering recorded · Fall 2026
The course is consistently described as hard, requiring significant extra time outside of class. Workload includes challenging homeworks and a stressful final exam that varies in difficulty, with grading often relying on participation or bonus points.