The following pages link to Inverse NP problems (Q937196):
Displaying 7 items.
- \textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete (Q418733) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- All superlinear inverse schemes are coNP-hard (Q2575753) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- Inverse Unfold Problem and Its Heuristic Solving (Q5240134) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311112) (← links)
- Algorithmic Applications in Management (Q5710144) (← links)