The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that defines IndependentSet. This result can also be understood as that every sentence that defines a NP-complete problem P can be decomposed in two disjuncts such that the first one characterizes a fragment of P as hard as IndependentSet and the second the rest of P. That is, a decomposition that divides every such sentence into a a “quotient and residue” modulo IndependentSet. In this paper, we show that this result can be generalized over a wide collection of complexity classes, including the so-called nice classes. Moreover, we show that such decomposition can be done for any complete problem with respect to the given class, and that two such decompositions are non-equivalent in general. Interestingly, our results are based on simple and well-known properties of first-order reductions.
[1]
Erich Grädel,et al.
Capturing Complexity Classes by Fragments of Second-Order Logic
,
1991,
Theor. Comput. Sci..
[2]
Jose Antonio Medina-Peralta.
A descriptive approach to the class NP
,
1997
.
[3]
Neil Immerman,et al.
Descriptive Complexity
,
1999,
Graduate Texts in Computer Science.
[4]
Christos H. Papadimitriou,et al.
Computational complexity
,
1993
.
[5]
Ronald Fagin.
Generalized first-order spectra, and polynomial. time recognizable sets
,
1974
.
[6]
J.A. Medina,et al.
A syntactic characterization of NP-completeness
,
1994,
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.
[7]
Neil Immerman,et al.
A First-Order Isomorphism Theorem
,
1997,
SIAM J. Comput..
[8]
P. Nijjar.
An Attempt to Automate NP -Hardness Reductions via SO ∃ Logic
,
2004
.
[9]
Elias Dahlhaus,et al.
Reduction to NP-complete problems by interpretations
,
1983,
Logic and Machines.