Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03229497n
Noun Named Entity
EL
No term available
EN
In computational complexity, problems that are in the complexity class NP but are neither in the class P nor NP-complete are called NP-intermediate, and the class of such problems is called NPI. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
PART OF
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