Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00524255n
Noun Named Entity
EL
No term available
EN
In computational complexity theory, SNP is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph-theoretical properties. Wikipedia
English:
complexity
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