All Superlinear Inverse Schemes are coNP-Hard
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
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.
Create a lesson
Related papers
Semidirect sums of tensors and the matrix multiplication exponent
Baitian Li
On the Role of Geometry in Solving Variational Inequalities
Ioannis Anagnostides, Ioannis Panageas, Jingming Yan
The Complexity of ReLU Network Synthesis from a Parameter Multiset
Dimitrios Myrisiotis
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients
Argyrios Deligkas, Michail Fasoulakis, Stavros D. Ioannidis
A Circuit Complexity Trichotomy For Regular Languages
Stefan Göller, Amaldev Manuel
Determinant boundaries and gaps in determinantal complexity
Karthik Sheshadri