Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01649624n
Noun Named Entity
SYL
No term available
EN
In computational complexity theory, a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either "yes" or "no". Wikipedia
Relations
Sources
IS A
EN
complexity class
EN
computational problem
HAS PART
EN
strong NP-completeness
EN
Weak NP-completeness
PART OF
NP
EN
NP-hardness
HAS KIND
EN
Cook–Levin theorem
HAS INSTANCE
EN
constraint satisfaction problem
EN
Boolean satisfiability problem
FR
problème 3-SAT
FR
problème du k-supplier
FR
Mojidoku
+1 relations
FACET OF
EN
P versus NP problem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License