Adjective
NP-easy (not comparable)
(computing theory) Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
An example of an NP-easy problem is the problem of sorting a list of strings. Source: Internet
To show that FIND-SUBSET-SUM is NP-equivalent, we must show that it is both NP-hard and NP-easy. Source: Internet
NP-easy is another name for FP NP (see the function problem article) or for FΔ 2 P (see the polynomial hierarchy article). Source: Internet
The definition of NP-easy uses a Turing reduction rather than a many-one reduction because the answers to problem Y are only TRUE or FALSE, but the answers to problem X can be more general. Source: Internet
There are also more difficult problems that are NP-easy. Source: Internet