NP-easy (Q505373)
set of function problems that are solvable in polynomial time by a nondeterministic Turing machine with an oracle for some decision problem in NP
Language:
other details
aliases FP^NP
description set of function problems that are solvable in polynomial time by a nondeterministic Turing machine with an oracle for some decision problem in NP

External Links
(P646) /m/0f88v
(P6366) 136417705