NP-easy (Q505373)
Jump to navigation
Jump to search
set of function problems that are solvable in polynomial time by a nondeterministic Turing machine with an oracle for some decision problem in NP
- FP^NP
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-easy |
set of function problems that are solvable in polynomial time by a nondeterministic Turing machine with an oracle for some decision problem in NP |
|