Inverse HAMILTONIAN CYCLE and inverse 3-d MATCHING are coNP-Complete

Authors:
Michael Krüger;Harald Hempel
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena;Institut für Informatik, Friedrich-Schiller-Universität Jena
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 3
Cited 1

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 3Dimensional Matching are coNP-complete

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.