bn:00524255n
Noun Named Entity
AR
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