All Superlinear Inverse Schemes are coNP-Hard
Computational Complexity
2007-05-23 v1 Cryptography and Security
Abstract
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.
Cite
@article{arxiv.cs/0410023,
title = {All Superlinear Inverse Schemes are coNP-Hard},
author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Harald Hempel},
journal= {arXiv preprint arXiv:cs/0410023},
year = {2007}
}
Comments
Conf. version was in MFCS 2004