Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346262n
Noun Named Entity
EL
No term available
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
Relations
Sources
IS A
κλάση πολυπλοκότητας
υπολογιστικό πρόβλημα
HAS PART
NP-completeness
EN
NP-equivalent

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