Sciweavers

MFCS
2004
Springer

All Superlinear Inverse Schemes Are coNP-Hard

13 years 9 months ago
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.
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald H
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where MFCS
Authors Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
Comments (0)