All Superlinear Inverse Schemes are coNP-Hard
classification
💻 cs.CC
cs.CR
keywords
conp-hardbuildscertificatescertifiedcircuitdevelopdiagonalizationsdirectly
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.