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: Any problem that is in NP can be changed so that to the Boolean satisfiability theorem . On a deterministic Turing machine this takes polynomial time .