Wiktionary

NP-easy

English

edit
 
English Wikipedia has an article on:
Wikipedia

Adjective

edit

NP-easy (not comparable)

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

Anagrams

edit
Retrieved from "https://en.wiktionary.org/w/index.php?title=NP-easy&oldid=77959843"