Original: That is , any problem in NP can be reduced in polynomial time by a deterministic Turing machine to the problem of determining whether a Boolean formula is satisfiable .
Simplified: The Cook -- Levin theorem is a theorem from theoretical computer science , which says that the Boolean satisfiability problem is NP-complete .