Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03456815n
Noun Named Entity
EL
No term available
EN
In computational complexity theory, co-NP is a complexity class. A decision problem Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
υπολογιστικό πρόβλημα
HAS PART
EN
co-NP-complete
p

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