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.
Cite
CITATION STYLE
Stewart, I. A. (1992). On completeness for NP via projection translations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 626 LNCS, pp. 353–366). Springer Verlag. https://doi.org/10.1007/bfb0023781
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
