Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
In this paper we show that the inverse problems of HAMILTONIAN CYCLE and 3-D MATCHING are coNP complete. This completes the study of inverse problems of the six natural NP-complete problems from  and answers an open question from . We classify the inverse complexity of the natural verifier for HAMILTONIAN CYCLE and 3-D MATCHING by showing coNP-completeness of the corresponding inverse problems.
Keywordscomputational complexity coNP-completeness inverse NP-problems HAMILTONIAN CYCLE 3-DIMENSIONAL MATCHING
Unable to display preview. Download preview PDF.
- 6.West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2001)Google Scholar