Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
We show that every language in NP has a probablistic verifier that checks membership proofs for it using logarithmic number of… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the… Expand
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We study a novel genre of optimization problems, which we call segmentation problems, motivated in part by certain aspects of… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
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
  • figure 1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Abstract We prove that the NP-hard problem of finding in an undirected graph G a spanning tree with a maximum number of leaves is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The complexity of several natural computational problems in NP, which have been proposed but not categorized satisfactorily in… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The class PCP(f(n),g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in… Expand
  • figure 1
Is this relevant?