Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346262n
Noun Named Entity
Categories: long volume value, NP-hard problems, Complexity classes
EN
NP-hardness  NP-hard  NP-hard problem  NP-hard problems  NP hard
EN
In computational complexity theory, NP-hardness is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, NP-hardness is the defining property of a class of problems that are informally "at least as hard as the hardest problems in NP". Wikipedia
Complexity class Wikidata
IS A
complexity class
computational problem
HAS PART
NP-complete
NP-equivalent
Wikipedia
EN
NP-hardness
Wikidata
EN
NP-hardness
Wikipedia Redirections
EN
NP-hard, NP-hard problem, NP-hard problems, NP hard
Wikidata Alias
EN
NP-hard

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