Original: In computational complexity theory , the Cook -- Levin theorem , also known as Cook 's theorem , states that the Boolean satisfiability problem is NP-complete .
Simplified: Any problem that is in NP can be changed so that to the Boolean satisfiability theorem .