All Superlinear Inverse Schemes Are coNP-Hard
نویسندگان
چکیده
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
منابع مشابه
23 v 1 1 2 O ct 2 00 4 All Superlinear Inverse Schemes are coNP - Hard ∗
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
متن کاملO ct 2 00 4 All Superlinear Inverse Schemes are coNP - Hard ∗
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
متن کاملInverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete
In this paper we show that the Inverse problems of HAMILTONIAN CYCLE and 3D-MATCHING are coNP complete. This completes the study of inverse problems of the six natural NP-complete problems from [GJ79] and answers an open question from [Ch03]. We classify the inverse complexity of the natural verifier for HAMILTONIAN CYCLE and 3D-MATCHING by showing coNP-completeness of the corresponding inverse...
متن کاملInverse Problems Have Inverse Complexity
In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σ i 3CNFSAT is known to be coNP-complete [6] for i = 1 we prove that it remains coNP-complete for i = 2 and is in P for all i ≥ 3. Relatedly, we show that inverting Σ i 3DNFSAT is in P for all i ≥ 1.
متن کاملRecognizing Pseudo-intents is coNP-complete
The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004