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: On a deterministic Turing machine this takes polynomial time.