Skip to search formSkip to main contentSkip to account menu

SNP (complexity)

Known as: MAXSNP, Strict NP, SNP 
In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as… 
Highly Cited
1995
Highly Cited
1995
Let Dist(f,g)=Pr/sub u/ [f(u)/spl ne/g(u)] denote the relative distance between functions f,g mapping from a group G to a group H… 
1995
1995
In this article we look at the register allocation problem. In the literature this problem is frequently reduced to the general… 
Highly Cited
1994
Highly Cited
1994
We consider the following problem: given a collection of strings <italic>s<subscrpt>1</subscrpt></italic>,…, <italic>s<subscrpt>m…