SNP (complexity)

In computational complexity theory, SNP (from Strict NP) is a complexity class containing a limited subset of NP based on its logical characterization in terms of graph-theoretical properties. It forms the basis for the definition of the class MaxSNP of optimization problems.

It is defined as the class of problems that are properties of relational structures (such as graphs) expressible by a second-order logic formula of the following form:

,

where are relations of the structure (such as the adjacency relation, for a graph), are unknown relations (sets of tuples of vertices), and is a quantifier-free formula: any boolean combination of the relations.[1] That is, only existential second-order quantification (over relations) is allowed and only universal first-order quantification (over vertices) is allowed. If existential quantification over vertices were also allowed, the resulting complexity class would be equal to NP (more precisely, the class of those properties of relational structures that are in NP), a fact known as Fagin's theorem.

For example, SNP contains 3-Coloring (the problem of determining whether a given graph is 3-colorable), because it can be expressed by the following formula:

.

Here denotes the adjacency relation of the input graph, while the sets (unary relations) correspond to sets of vertices colored with one of the 3 colors. Similarly, SNP contains the k-SAT problem: the boolean satisfiability problem (SAT) where the formula is restricted to conjunctive normal form and to at most k literals per clause, where k is fixed.

MaxSNP

An analogous definition considers optimization problems, when instead of asking a formula to be satisfied for all tuples, one wants to maximize the number of tuples for which it is satisfied. That is, MaxSNP0 is defined as the class of optimization problems on relational structures expressible in the following form:

MaxSNP is then defined as the class of all problems with an L-reduction (linear reduction, not log-space reduction) to problems in MaxSNP0.[2] For example, MAX-3SAT is a problem in MaxSNP0: given an instance of 3-CNF-SAT (the boolean satisfiability problem with the formula in conjunctive normal form and at most 3 literals per clause), find an assignment satisfying as many clauses as possible. In fact, it is a natural complete problem for MaxSNP.

There is a fixed-ratio approximation algorithm to solve any problem in MaxSNP, hence MaxSNP is contained in APX, the class of all problems approximable to within some constant ratio. In fact the closure of MaxSNP under PTAS reductions (slightly more general than L-reductions) is equal to APX; that is, every problem in APX has a PTAS reduction to it from some problem in MaxSNP. In particular, every MaxSNP-complete problem (under L-reductions or under AP-reductions) is also APX-complete (under PTAS reductions), and hence does not admit a PTAS unless P=NP. However, the proof of this relies on the PCP theorem, while proofs of MaxSNP-completeness are often elementary.

See also

References
  1. Feder, Tomás; Vardi, Moshe Y. (1993). "Monotone monadic SNP and constraint satisfaction". Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. doi:10.1145/167088.167245.
  2. Papadimitriou, Christos H.; Yannakakis, Mihalis (1991). "Optimization, approximation, and complexity classes". J. Comput. Syst. Sci. 43 (3): 425–440. Zbl 0765.68036.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.