Inverse NP problems

DOI10.1007/s00037-008-0240-6zbMath1149.68037OpenAlexW2039931384MaRDI QIDQ937196

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

reductionsNP verifiers

Mathematics Subject Classification ID

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

Related Items (2)

Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem ⋮ A Dichotomy Theorem for the Inverse Satisfiability Problem

This page was built for publication: Inverse NP problems