Back to Explore
Computer SciencePhD 4.9 · 260
Advanced Algorithms
Doctoral algorithm design: NP-completeness, approximation, and the limits of efficient computation.
Dr. Priyanka Rao
Theoretical Computer Scientist
Course progress0 / 4 lessons
1
P, NP & NP-Completeness
The frontier of efficient computation.
11 min +120 XP2 quiz questions
2
Coping with Hard Problems
Approximation and heuristics.
10 min +110 XP2 quiz questions
3
Approximation Algorithms
Provably-good answers to intractable problems.
10 min +90 XP2 quiz questions
4
Randomized Algorithms
Using coin flips to compute efficiently.
10 min +90 XP2 quiz questions