The Satisfiability Problem, and SAT is in NP
72,216 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% confidenceIntroduces the Boolean satisfiability problem and proves it lies in NP by exhibiting a polynomial-time verifier, setting up the Cook–Levin proof.
What you'll learn
The Boolean satisfiability problem and why SAT is in NP.
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.