All superlinear inverse schemes are coNP-hard

Authors:
Edith Hemaspaandra;Lane A. Hemaspaandra;Harald Hempel
Affiliations:
Department of Computer Science, Rochester Institute of Technology, Rochester, NY and University of Rochester;Department of Computer Science, University of Rochester, Rochester, NY;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany and and University of Rochester
Venue:
Theoretical Computer Science - Mathematical foundations of computer science 2004
Year:
2005

Citing 7
Cited 3

Sets with small generalized Kolmogorov complexity

Acta Informatica
Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
The Boolean hierarchy I: structural properties

SIAM Journal on Computing
The Boolean hierarchy II: applications

SIAM Journal on Computing
On the computational complexity of small descriptions

SIAM Journal on Computing
The complexity theory companion

The complexity theory companion
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Inverse NP Problems

Computational Complexity
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete

Theoretical Computer Science
Inverse HAMILTONIAN CYCLE and inverse 3-d MATCHING are coNP-Complete

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.01

Visualization

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.