NP-easy

Definition from Wiktionary, the free dictionary
Jump to navigation Jump to search

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=65518670"