Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,258,702 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.
2010
2010
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Carsten Fuhs
,
Peter Schneider-Kamp
International Conference on Theory and…
2010
Corpus ID: 16014071
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as…
Expand
Highly Cited
2008
Highly Cited
2008
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
L. Bertossi
,
Loreto Bravo
,
Enrico Franconi
,
Andrei Lopatenko
Information Systems
2008
Corpus ID: 39850768
2007
2007
Order Scheduling Models: Hardness and Algorithms
Naveen Garg
,
Amit Kumar
,
Vinayaka Pandit
Foundations of Software Technology and…
2007
Corpus ID: 1041753
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each…
Expand
Highly Cited
2003
Highly Cited
2003
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
J. Gramm
,
E. Hirsch
,
R. Niedermeier
,
P. Rossmanith
Discrete Applied Mathematics
2003
Corpus ID: 30677220
Highly Cited
2003
Highly Cited
2003
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
G. Călinescu
,
Cristina G. Fernandes
,
B. Reed
J. Algorithms
2003
Corpus ID: 9991730
Highly Cited
2001
Highly Cited
2001
The complexity of multiple sequence alignment with SP-score that is a metric
P. Bonizzoni
,
G. D. Vedova
Theoretical Computer Science
2001
Corpus ID: 1473481
Highly Cited
1995
Highly Cited
1995
Linearity testing in characteristic two
M. Bellare
,
D. Coppersmith
,
J. Håstad
,
Marcos A. Kiwi
,
M. Sudan
Proceedings of IEEE 36th Annual Foundations of…
1995
Corpus ID: 12913126
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…
Expand
1995
1995
Register allocation in structured programs
Sampath Kannan
,
Todd A. Proebsting
ACM-SIAM Symposium on Discrete Algorithms
1995
Corpus ID: 8305577
In this article we look at the register allocation problem. In the literature this problem is frequently reduced to the general…
Expand
Highly Cited
1994
Highly Cited
1994
Linear approximation of shortest superstrings
Avrim Blum
,
Tao Jiang
,
Ming Li
,
J. Tromp
,
M. Yannakakis
JACM
1994
Corpus ID: 52151541
We consider the following problem: given a collection of strings <italic>s<subscrpt>1</subscrpt></italic>,…, <italic>s<subscrpt>m…
Expand
Highly Cited
1994
Highly Cited
1994
Maximum Bounded H-Matching is MAX SNP-Complete
V. Kann
Information Processing Letters
1994
Corpus ID: 43449574
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