Inverse NP problems

DOI10.1007/S00037-008-0240-6MaRDI QIDQ937196zbMATH OpenOpenAlexFDO

Authors Hubie Chen

Publication date 20 August 2008

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00037-008-0240-6

zbMATH Keywords

NP verifiersreductions

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Mathematical Foundations of Computer Science 2003
• Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
• \textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
• All superlinear inverse schemes are coNP-hard

Cited in

(9)

• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
• All superlinear inverse schemes are coNP-hard
• \textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete
• A dichotomy theorem for the inverse satisfiability problem
• Inverse Unfold Problem and Its Heuristic Solving
• Mathematical Foundations of Computer Science 2004
• Mathematical Foundations of Computer Science 2003
• Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
• Algorithmic Applications in Management

This page was built for publication: Inverse NP problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q937196)