Cook-Levin Theorem: Full Proof (SAT is NP-complete)
34,878 views
Why it's on BrighterTube
Hand-picked by a BrighterTube curator · found via Reddit r/compsci thread: What are your favorite Comp Sci YouTube channels? · 84% confidenceProves the Cook–Levin theorem in full over half an hour, building the tableau that encodes a nondeterministic Turing machine's run as a Boolean formula and checking every clause.
What you'll learn
A full proof of the Cook–Levin theorem: SAT is NP-complete.
Video by Easy Theory, played through YouTube's embedded player.
Part of Complexity Theory I - Easy Theory
Go deeper
As an Amazon Associate, BrighterTube earns from qualifying purchases. Picked by hand for this subject; nobody paid to be listed.