NP-easy

In complexity theory, the complexity class called NP- easily the set of all functions that can be computed by a deterministic Turing machine using an oracle Turing machine for a decision problem from the class NP in polynomial time.

• Complexity Theory