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.
2015
2015
Scaffold filling is an interesting combinatorial optimization problem from genome sequencing. The one-sided scaffold filling… 
2012
2012
Monotone monadic strict NP (MMSNP) is a class of computational problems that is closely related to the class of constraint… 
2010
2010
We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the… 
2009
2009
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given formula, using a minimal number of… 
2003
2003
We consider the problem of finding a fundamental cycle basis of minimum total weight in the cycle space associated with an… 
2002
2002
2002
2002
We study the data placement problem [1, 3], where the goal is to place certain data objects (with possible replication) in fixed…