Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346251n
Noun Named Entity
SYL
No term available
EN
In complexity theory, computational problems that are co-NP-complete are those that are the hardest problems in co-NP, in the sense that any problem in co-NP can be reformulated as a special case of any co-NP-complete problem with only polynomial overhead. Wikipedia
Relations
Sources
IS A
EN
complexity class
EN
computational problem
PART OF
EN
co-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