NP-easy

from Wikipedia, the free encyclopedia

In complexity theory , the complexity class NP-light denotes the set of all functions that can be calculated in polynomial time by a deterministic Turing machine with the help of an oracle-Turing machine for a decision problem from the class NP .