NP-Completeness ·
Reductions & Cook-Levin
un
seel
.com · in NP + NP-hard · SAT is the root
Reductions
0
State
—
Step
—
SAT (Cook-Levin root)
NP-complete problem
Polynomial reduction ≤ₚ
Solved (P = NP)
▶ Play
←
→
Unmute
Reset
Un
seel
.com · NP-Completeness