# 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

**Wikidata**: [Q505373](https://www.wikidata.org/wiki/Q505373)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/NP-easy)  
**Source**: https://4ort.xyz/entity/np-easy


## References

1. Freebase Data Dumps. 2013