Abstract
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 [2] and answers an open question from [1]. 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, H.: Inverse NP problems. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 338–347. Springer, Heidelberg (2003)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)
Hemaspaandra, E.L., Hempel, H.: All superlinear inverse schemes are coNP-hard. Theoretical Computer Science 345(2-3), 345–358 (2005)
Kavvadias, D., Sideri, M.: The inverse satisfiability problem. SIAM Journal on Computing 28(1), 152–163 (1998)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krüger, M., Hempel, H. (2006). Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_26
Download citation
DOI: https://doi.org/10.1007/11940128_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)