All Superlinear Inverse Schemes Are coNP-Hard

  • Edith Hemaspaandra
  • Lane A. Hemaspaandra
  • Harald Hempel
Conference paper

DOI: 10.1007/978-3-540-28629-5_27

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3153)
Cite this paper as:
Hemaspaandra E., Hemaspaandra L.A., Hempel H. (2004) All Superlinear Inverse Schemes Are coNP-Hard. In: Fiala J., Koubek V., Kratochvíl J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Edith Hemaspaandra
    • 1
  • Lane A. Hemaspaandra
    • 2
  • Harald Hempel
    • 3
  1. 1.Department of Computer ScienceRochester Institute of TechnologyRochesterUSA
  2. 2.Department of Computer ScienceUniversity of RochesterRochesterUSA
  3. 3.Institut für InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations