Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01440834n
Noun Named Entity
Categories: Complexity classes
EN
NP  NP-class  NP-Problem  class NP  complexity class NP
EN
In computational complexity theory, NP is a complexity class used to classify decision problems. Wikipedia
English:
class
complexity class
complexity
Definitions
Relations
Sources
EN
In computational complexity theory, NP is a complexity class used to classify decision problems. Wikipedia
Nondeterministic Polynomial, a computational complexity class Wikipedia Disambiguation
Computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time Wikidata
IS A
complexity class
HAS PART
SNP
NP-complete
UP
NP-intermediate
Wikipedia
EN
NP (complexity)
Wikidata
EN
NP
Wikipedia Redirections
EN
class NP, complexity class NP, nondeterministic polynomial, nondeterministic polynomial time, NP-Class, NP-class, NP-Problem, NP-problem, NP (class), Np (complexity), NP class, NP Class
Wikidata Alias
EN
nondeterministic polynomial, nondeterministic polynomial time, NP class

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