The Inverse Satisfiability Problem
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science - Mathematical foundations of computer science 2004
Inverse HAMILTONIAN CYCLE and inverse 3-d MATCHING are coNP-Complete
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 5.23 |
In this paper, we show that the inverse problems of Hamiltonian Cycle and 3Dimensional Matching are coNP-complete. This completes the study of inverse problems of the six natural NP-complete problems from Garey and Johnson (1979) [2] and answers an open question from Chen (2003) [1]. We show that the coNP-completeness of the inverse problem of Hamiltonian Cycle holds for undirected as well as for directed graphs.