All Superlinear Inverse Schemes Are coNP-Hard
- Cite this paper as:
- Hemaspaandra E., Hemaspaandra L.A., Hempel H. (2004) All Superlinear Inverse Schemes Are coNP-Hard. In: Fiala J., Koubek V., Kratochvíl J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. As part of our work we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
Unable to display preview. Download preview PDF.