NP-easy en · ADJ Meanings (not-comparable) Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.