e/SNP (complexity)

Information
has gloss	eng: In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph-theoretical properties. It forms the basis for the definition of the class MaxSNP of optimization problems.
lexicalization	eng: SNP
instance of	e/Complexity class