Suggested preparation: Algorithms, discrete mathematics and proof-writing.
Optional preparation: Free MIT Course: Theory of Computation and Automata.
About this course
Study the limits of efficient computation through reductions, satisfiability and hardness of approximation. MIT lectures connect formal complexity classes with examples of difficult algorithmic problems.
Topics and lesson examples
- 1. Overview
- 6. Circuit SAT
- 12. Gaps and PCP
- 17. Nondeterministic Constraint Logic
- 23. PPAD Reductions
Course at a glance
| Provider | MIT |
|---|---|
| Platform | YouTube · MIT OpenCourseWare |
| Access | Free Video |
| Level | Professional — WikiFree study-level assessment |
| Language | English |
| Available lessons | 23 |
| Video duration | 31h 3m · self-paced |
| Details checked | 10 October 2026 |
Preparation and study approach
Suggested preparation: Algorithms, discrete mathematics and proof-writing.
Follow the available videos in sequence, pausing to summarize the main argument or reconstruct a worked example. Keep a short list of assumptions, unfamiliar terms and questions to revisit. Additional reading, problem solving and practice will take time beyond the listed video duration.
Using this video classroom
Select a lesson from the list, or search for a topic. Previous and Next move through the sequence. You can mark lessons complete; progress is stored in this browser without a WikiFree account.
Free access and course scope
The public MIT OpenCourseWare videos in this classroom are free to watch. This listing provides the available playlist recordings, which may include selected lectures, recitations, demonstrations or supporting discussions rather than every component of the original campus course. Textbooks, equipment, software licenses, supervised labs, graded assignments and instructor feedback are not supplied by WikiFree. No purchase is required to watch the videos or use the note-based study approach above.
WikiFree independently organizes these resources for self-paced study. Watching does not award an MIT certificate, academic credit or admission to MIT.
Video provider and credit: MIT OpenCourseWare on YouTube. WikiFree titles, descriptions and cover artwork are independently prepared.
Related courses for your next step
- Review a lower-level optionFree MIT Course: Theory of Computation and Automata
Focus: 1. Introduction, Finite Automata, Regular Expressions · 7. Decision Problems for Automata and Grammars
Intermediate - Compare another approachFree MIT Course: Algorithm Design and Complexity Analysis
Focus: 1. Course Overview, Interval Scheduling · R4. Randomized Select and Randomized Quicksort
Professional
Compare course focus, level and study time
| Course | Level | Focus | Study time |
|---|---|---|---|
| This course — Free MIT Course: Computational Complexity and Algorithmic Lower Bounds | Professional | 1. Overview · 6. Circuit SAT · 12. Gaps and PCP | 31h 3m of video; practice time is additional |
| Free MIT Course: Theory of Computation and Automata | Intermediate | 1. Introduction, Finite Automata, Regular Expressions · 7. Decision Problems for Automata and Grammars · 14. P and NP, SAT, Poly-Time Reducibility | 32h 18m of video; practice time is additional |
| Free MIT Course: Algorithm Design and Complexity Analysis | Professional | 1. Course Overview, Interval Scheduling · R4. Randomized Select and Randomized Quicksort · R6. Greedy Algorithms | 39h 28m of video; practice time is additional |
Provider: MIT. Videos play from the MIT OpenCourseWare channel on YouTube.
Report a correction
Questions & discussion
Share a useful question or correction. Comments appear after moderation. Please avoid personal or sensitive information.