Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03346366n
Noun Named Entity
EL
No term available
EN
In complexity theory, the complexity class NP-easy is the set of function problems that are solvable in polynomial time by a deterministic Turing machine with an oracle for some decision problem in NP. Wikipedia
Relations
Sources
IS A
κλάση πολυπλοκότητας
HAS PART
EN
NP-equivalent
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