NP-easy

From Wiktionary, the free dictionary

Archived revision by NadandoBot (talk | contribs) as of 14:08, 27 November 2018.

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

English

English Wikipedia has an article on:

NP-easy

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

Spayen, payens, paynes

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

Hidden categories: