Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01649624n
Noun Named Entity
Categories: 1971 in computer science, Complexity classes, All Wikipedia articles needing clarification, NP-complete problems, Articles with short description
EN
NP-complete  NP-completeness  Np completeness  CNP  Non-deterministic polynomial-time complete  NPC
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
Definitions
Relations
Sources
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
A class of decision problems Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
computational problem
HAS PART
strong NP-completeness
Weak NP-completeness
PART OF
NP
NP-hardness
HAS KIND
Cook–Levin theorem
HAS INSTANCE
constraint satisfaction problem
Boolean satisfiability problem
FR
problème 3-SAT
FR
problème du k-supplier
FR
Mojidoku
+1 relations
FACET OF
P versus NP problem
Wikipedia
EN
NP-completeness
Wikidata
EN
NP-complete
Wikipedia Redirections
EN
Non-deterministic polynomial-time complete, Non polynomial complete, Nondeterministic Polynomial Complete, NP-C, NP-complete, NP-complete language, NP-complete problem, NP-complete problems, NP-Completeness, NP complete, NP completeness, Np completeness
Wikidata Alias
EN
CNP, nondeterministic polynomial time-complete, nondeterministic polynomial time-complete class, NPC

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