NP-easy
English
Adjective
- (computing theory) solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.