Advanced Algorithms
Doctoral algorithm design: NP-completeness, approximation, and the limits of efficient computation.
Dr. Priyanka Rao
Theoretical Computer Scientist
P, NP & NP-Completeness
The frontier of efficient computation.
Coping with Hard Problems
Approximation and heuristics.
Approximation Algorithms
Provably-good answers to intractable problems.
Randomized Algorithms
Using coin flips to compute efficiently.
Common questions
Who is "Advanced Algorithms" for?
It is written for learners at PhD level (Doctoral), and for anyone older who wants a clear refresher on computer science. Doctoral algorithm design: NP-completeness, approximation, and the limits of efficient computation. There is no application or entry test — you can start the first lesson straight away.
How long does the course take?
There are 4 lessons totalling 41 minutes of reading and quizzes, laid out over 2 units. You can move at your own pace — progress is saved as you go.
What do I need to know before starting?
No prior coursework is assumed. The course opens with "Complexity Classes", covering p vs np and reductions, so the foundations are built in rather than expected.
Is the course free?
Yes. Every course on Monster Class is completely free, with no credit card, trial period or paywall. Creating a free account simply saves your progress, XP and place on the leaderboard across devices.