NP-easy

English

Adjective

NP-easy (not comparable)

(computing theory) Solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP.

Anagrams

Payens, Paynes, Spayen, payens, paynes

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.