Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,930,384 papers from all fields of science
Search
Sign In
Create Free Account
SNP (complexity)
Known as:
MAXSNP
, Strict NP
, SNP
Expand
In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
APX
Approximation algorithm
Betweenness
Boolean satisfiability problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Approximation and Nonapproximability for the One-Sided Scaffold Filling Problem
Haitao Jiang
,
Jingjing Ma
,
Junfeng Luan
,
Daming Zhu
International Computing and Combinatorics…
2015
Corpus ID: 8431810
Scaffold filling is an interesting combinatorial optimization problem from genome sequencing. The one-sided scaffold filling…
Expand
2012
2012
On the Complexity of MMSNP
M. Bodirsky
,
Hubie Chen
,
T. Feder
SIAM Journal on Discrete Mathematics
2012
Corpus ID: 2814456
Monotone monadic strict NP (MMSNP) is a class of computational problems that is closely related to the class of constraint…
Expand
2010
2010
On the Complexity of the $k$-Anonymization Problem
Venkatesan T. Chakaravarthy
,
Vinayaka Pandit
,
Yogish Sabharwal
arXiv.org
2010
Corpus ID: 17082459
We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the…
Expand
2009
2009
On Approximate Horn Minimization
B. Dasgupta
,
D. Mubayi
2009
Corpus ID: 10105174
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given formula, using a minimal number of…
Expand
2006
2006
A fixed-parameter tractability result for multicommodity demand flow in trees
Jiong Guo
,
R. Niedermeier
Information Processing Letters
2006
Corpus ID: 11582736
2003
2003
On the Approximability of the Minimum Fundamental Cycle Basis Problem
G. Galbiati
,
E. Amaldi
Workshop on Approximation and Online Algorithms
2003
Corpus ID: 43827313
We consider the problem of finding a fundamental cycle basis of minimum total weight in the cycle space associated with an…
Expand
2002
2002
Aligning two fragmented sequences
V. Veeramachaneni
,
P. Berman
,
W. Miller
Proceedings 16th International Parallel and…
2002
Corpus ID: 1793777
2002
2002
Improved algorithms for the data placement problem
S. Guha
,
Kamesh Munagala
ACM-SIAM Symposium on Discrete Algorithms
2002
Corpus ID: 14563588
We study the data placement problem [1, 3], where the goal is to place certain data objects (with possible replication) in fixed…
Expand
1998
1998
Fixed topology alignment with recombination
Lusheng Wang
,
Bin Ma
,
Ming Li
Discrete Applied Mathematics
1998
Corpus ID: 15731393
1995
1995
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet
M. Middendorf
Theoretical Computer Science
1995
Corpus ID: 16289534
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE