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: The Cookâ "Levin theorem is a theorem from theoretical computer science, which says that the Boolean satisfiability problem is NP-complete.