3SAT is NP-complete Proof
44,818 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 3SAT is NP-complete by reducing general SAT to it, showing how long clauses are split into three-literal clauses with fresh variables.
What you'll learn
Proof that 3SAT is NP-complete via reduction from SAT.
Video by Easy Theory, played through YouTube's embedded player.
Part of Reducibility - Easy Theory, 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.