Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03229497n
Noun Named Entity
Categories: Complexity classes
EN
NP-intermediate  Ladner's theorem  Ladner theorem
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
Definitions
Relations
Sources
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
A complexity class in computational complexity theory Wikipedia Disambiguation
Complexity class Wikidata
IS A
complexity class
PART OF
NP
Wikipedia
EN
NP-intermediate
Wikidata
EN
NP-intermediate
Wikipedia Redirections
EN
Ladner's theorem, Ladner theorem, NP-Intermediate

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