Home
Random
Log in
Settings
Donations
About Wiktionary
Disclaimers
Search
NP-easy
Language
Watch
Edit
English
edit
English
Wikipedia
has an article on:
NP-easy
Wikipedia
Adjective
edit
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
edit
Payens
,
Paynes
,
Spayen
,
payens
,
paynes
Categories
:
English lemmas
English adjectives
English uncomparable adjectives
English multiword terms
en:Theory of computing