Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346414n
Noun Named Entity
EL
No term available
EN
In computational complexity theory, the complexity class NP-equivalent is the set of function problems that are both NP-easy and NP-hard. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
PART OF
EN
NP-hardness
EN
NP-easy
NAMED AFTER
NP

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