Robust Reductions

  • Jin-Yi Cai
  • Lane A. Hemaspaandra
  • Gerd Wechsung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)


We continue the study of robust reductions initiated by Gavaldà and Balcázar. In particular, a 1991 paper of Gavaldà and Balcázar [6] claimed an optimal separation between the power of robust and nondeterministic strong reductions. Unfortunately, their proof is invalid. We re-establish their theorem.

Generalizing robust reductions, we note that robustly strong reductions are built from two restrictions, robust underproductivity and robust overproductivity, both of which have been separately studied before in other contexts. By systematically analyzing the power of these reductions, we explore the extent to which each restriction weakens the power of reductions. We show that one of these reductions yields a new, strong form of the Karp-Lipton Theorem.


Turing Machine Strong Reduction Language Transformation Polynomial Hierarchy Downward Closure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. Journal of Computer and System Sciences, 39:21–50, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    E. Allender, R. Beigel, U. Hertrampf, and S. Homer. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science, 115:225–241, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    R. Beigel. On the relativized power of additional accepting paths. In Proceedings of the 4th Structure in Complexity Theory Conference, pages 216–224. IEEE Computer Society Press, June 1989.Google Scholar
  4. [4]
    J. Cai, L. Hemaspaandra, and G. Wechsung. Robust reductions. Technical Report TR-666, Department of Computer Science, University of Rochester, Rochester, NY, December 1997. Available on-line at Scholar
  5. [5]
    P. Crescenzi and R. Silvestri. Sperner’s lemma and robust machines. In Proceedings of the 8th Structure in Complexity Theory Conference, pages 194–199. IEEE Computer Society Press, May 1993.Google Scholar
  6. [6]
    R. Gavaldà and J. Balcázar. Strong and robustly strong polynomial time reducibilities to sparse sets. Theoretical Computer Science, 88(1):1–14, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    J. Hartmanis and L. Hemachandra. Robust machines accept easy sets. Theoretical Computer Science, 74(2):217–226, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    L. Hemaspaandra, A. Hoene, A. Naik, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Nondeterministically selective sets. International Journal of Foundations of Computer Science, 6(4):403–416, 1995.zbMATHCrossRefGoogle Scholar
  9. [9]
    J. Kadin. PNP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282–298, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    J. Kämper. Non-uniform proof systems: a new framework to describe non-uniform and probabilistic complexity classes. Theoretical Computer Science, 85(2):305–331, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302–309, April 1980.Google Scholar
  12. [12]
    J. Köbler and U. Schöning. High sets for NP. In D. Zu and K. Ko, editors, Advances in Algorithms, Languages, and Complexity, pages 139–156. Kluwer Academic Publishers, 1997.Google Scholar
  13. [13]
    J. Köbler and O. Watanabe. New collapse consequences of NP having small circuits. In Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming, pages 196–207. Springer-Verlag Lecture Notes in Computer Science #944, 1995.Google Scholar
  14. [14]
    T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1–25, 1982.zbMATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    T. Long and A. Selman. Relativizing complexity classes with sparse oracles. Journal of the ACM, 33(3):618–627, 1986.CrossRefMathSciNetGoogle Scholar
  16. [16]
    A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440–457, 1978.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Jin-Yi Cai
    • 1
  • Lane A. Hemaspaandra
    • 2
  • Gerd Wechsung
    • 3
  1. 1.Department of Computer ScienceState University of New York at BuffaloBuffaloUSA
  2. 2.Department of Computer ScienceUniversity of RochesterRochesterUSA
  3. 3.Institut für InformatikFriedrich-Schiller-Universität JenaJenaGermany

Personalised recommendations