NP-easy
Meanings
adj
- Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.
Word forms
Previous
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.