A syntactic characterization of NP-completeness

Fagin (1974) proved that NP is equal to the set of problems expressible in second-order existential logic (SO/spl exist/). We consider problems that are NP-complete via first-order projections (fops). These low-level reductions are known to have nice properties, including the fact that every pair of problems that are NP-complete via fops are isomorphic via a first-order definable isomorphism (E. Allender et al., 1993). However, before this paper, fewer than five natural problems had actually been shown to be NP-complete via fops. We give a necessary and sufficient syntactic condition for an SO/spl exist/ formula to represent a problem that is NP-complete via fops. Using this condition we prove syntactically that 29 natural NP-complete problems remain complete via fops.<<ETX>>

[1]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[2]  Steven Lindell.  A purely logical characterization of circuit uniformity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[3]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[4]  Mihalis Yannakakis,et al.  A Note on Succinct Representations of Graphs , 1986, Inf. Control..

[5]  Elias Dahlhaus,et al.  Reduction to NP-complete problems by interpretations , 1983, Logic and Machines.

[6]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[7]  Neil Immerman,et al.  A First-Order Isomorphism Theorem , 1993, SIAM J. Comput..

[8]  Erich Grädel.  Capturing Complexity Classes by Fragments of Second Order Logic , 1991, Computational Complexity Conference.

[9]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[10]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[11]  Erich Grädel,et al.  Capturing Complexity Classes by Fragments of Second-Order Logic , 1991, Theor. Comput. Sci..

[12]  Phokion G. Kolaitis,et al.  Approximation properties of NP minimization classes , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.