Search
Search Results
14 resultsSort by: Best Match
Sort by: Best Match
- Lecture VideoFreeLecture 16: Complexity: P, NP, NP-completeness, ReductionsFrom 6.046J: Design and Analysis of AlgorithmsFormat: Online
- Lecture VideoFreeLecture 5: SAT ReductionsFrom 6.890: Algorithmic Lower Bounds: Fun with Hardness ProofsFormat: Online
Filter
Content developed from MIT's academic and professional curriculum
Content developed from MIT's academic curriculum
Content developed from MIT's professional curriculum
