Home
R8. NP-Complete Problems
MIT OpenCourseWare
Mar 4, 2016
123,818 views
17. Complexity: Approximation Algorithms
P vs. NP: The Biggest Puzzle in Computer Science
NP-COMPLETENESS - The Secret Link Between Thousands of Unsolved Math Problems
Hamiltonian Path is NP-Complete (Directed, Reduction from 3SAT)
P vs NP on TV - Computerphile
8. NP-Hard and NP-Complete Problems
P vs. NP - The Biggest Unsolved Problem in Computer Science
Hamiltonian Cycle is NP-Complete (Algorithms 24)
Proving P=NP Requires Concepts We Don't Have | Richard Karp and Lex Fridman
What Makes Mario NP-Hard? (Polynomial Reductions)
Terence Tao at IMO 2024: AI and Mathematics
P vs. NP and the Computational Complexity Zoo
NP-complete problems: Samuel's tutorial
What is a polynomial-time reduction? (NP-Hard + NP-complete)
13. Incremental Improvement: Max Flow, Min Cut
P, NP and Approximation Algorithms: Prof. Naveen Garg, IIT-Delhi
Scott Aaronson: The Greatest Unsolved Problem in Math
16. Complexity: P, NP, NP-completeness, Reductions
Vertex Cover is NP-Complete + Example