What makes a problem "harder" than another problem? How can we say a problem is the hardest in a complexity class? In this video, we provide a proof sketch of the Cook-Levin theorem, introducing a critical concept known as NP-completeness.
Created by: Cory Chang
Produced by: Vivian Liu
Script Editor: Justin Chen, Zachary Greenberg, Elaine Chang, Brandon Chen
Music: Gravity Sound (https://www.youtube.com/channel/UCQ7Xmyu6eXpJfkEoMtRMv1w)
Twitter: https://twitter.com/UBehavior
—
References:
P vs NP Playlist: https://www.youtube.com/playlist?list=PLlwsleWT767dnN25K_QgvdKkovK_t4K6-
Cook-Levin Theorem: https://en.wikipedia.org/wiki/Cook–Levin_theorem
NP-Completeness: https://en.wikipedia.org/wiki/NP-completeness
Reduction: https://en.wikipedia.org/wiki/Reduction_(complexity)
SAT: https://en.wikipedia.org/wiki/Boolean_satisfiability_problem
Circuit-SAT: https://en.wikipedia.org/wiki/Circuit_satisfiability_problem
Circuits: https://en.wikipedia.org/wiki/Boolean_circuit
Turing Machine: https://en.wikipedia.org/wiki/Turing_machine
Lectures:
NP-Completeness and the Cook--Levin Theorem: https://youtu.be/QRYYDvgGQd0
