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. As part of our work we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
KeywordsTuring Machine Proof Technique Boolean Formula Partial Assignment Syntactic Property
Unable to display preview. Download preview PDF.
- 7.Meyer, A., Stockmeyer, L.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, October 1972, pp. 125–129 (1972)Google Scholar
- 10.Rogers Jr., H.: The Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)Google Scholar