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: An important consequence of the theorem is that if there exists a deterministic polynomial time algorithm for solving Boolean satisfiability, then there exists a deterministic polynomial time algorithm for solving all problems in NP.