Abstract
We show that our logical encodings of the Satisfiability Problem and the 3-Colourability Problem are complete for NP via projection translations. However, whilst an encoding of the 3-Satisfiability Problem where all clauses have at most 3 literals is also complete for NP via projection translations, we are unable to show that a similar encoding of this decision problem where all clauses have exactly 3 literals is complete for NP via projection translations. It appears to matter how we encode decision problems (as sets of finite structures) when we deal with weak reductions such as projection translations.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C.C.Chang, H.J.Keisler: Model Theory, North-Holland, Amsterdam, 1977.
E.Dahlhaus: Reduction to NP-complete problems by interpretations, Lecture Notes in Computer Science 171, Berlin: Springer-Verlag, 1979, 357–365.
R.Fagin: Generalized first-order spectra and polynomial-time recognizable sets, Complexity of Computation (Ed. R.Karp), SIAM-AMS Proc, 7, 1974, 27–41.
M.R.Garey and D.S.Johnson: Computers and intractability, W.H.Freeman and Co., San Francisco, 1979.
Y.Gurevich: Toward logic tailored for computational complexity, Computation and Proof Theory (Ed. E.Börger et al.), Lecture Notes in Mathematics 1104, Berlin: Springer-Verlag, 1984, 175–216.
Y.Gurevich: Logic and the challenge of computer science, in: Current Trends in Theoretical Computer Science (Ed. E. Börger), Computer Science Press, 1987, 1–57.
N.Immerman: Languages that capture complexity classes, SIAM J. Comput., 16, 4, 1987, 760–778.
N.Immerman: Nondeterministic space is closed under complementation, SIAM J. Comput., 17, 5, 1988, 935–938.
R.M.Karp, Reducibility among combinatorial problems, Complexity of computer computations (Ed. R.E.Miller and J.W.Thatcher), Plenum Press, New York, 1972, 85–103.
L.Lovasz and P.Gacs: Some remarks on generalized spectra, Zeitschr. f. math., Logik und Grundlagen d. Math., 23, 1977, 547–554.
U.Manber: Introduction to Algorithms: a creative approach, Addison-Wesley, Reading, Mass. 1989.
I.A.Stewart: The demise of the Turing machine in complexity theory, Proc. TURING 1990: A colloquium in celebration of Alan Turing, Brighton, England, April, 1990, Oxford Univ. Press, to appear.
I.A.Stewart: Using the Hamiltonian operator to capture NP, to appear, J. Comput. System Sci.
I.A.Stewart: Comparing the expressibility of languages formed using NP-complete operators, J. Logic Computat., 1, 3, 1991, 305–330.
I.A.Stewart: Complete problems for symmetric logspace involving free groups, Inform. Process. Lett., 40, 1991, 263–267.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stewart, I.A. (1992). On Completeness for NP via projection translations. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023781
Download citation
DOI: https://doi.org/10.1007/BFb0023781
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive