• NP-easy

NP-easy (suomeksi)

Määritelmät:

• (lb, en, comptheory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP