English Wikipedia - The Free Encycl...
Download this dictionary
NP-completeness
In
computational complexity theory
, a
decision problem
is
NP-complete
when it is both in
NP
and
NP-hard
. The set of NP-complete problems is often denoted by
NP-C
or
NPC
. The abbreviation
NP
refers to "
nondeterministic
polynomial time
".
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License