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 .
A deterministic Turing machine can change problem in NP in polynomial time to the problem of determining whether a Boolean formula is satisfiable .