Skip to main content
SpringerLink
Log in

Robust Reductions

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1449))

Included in the following conference series:

Abstract

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.

A complete version of this paper, including full proofs, is available as [4]. Research supported in part by grants DAAD-315-PRO-fo-ab/NSF-INT-9513368, NSF-CCR-9057486, NSF-CCR-9319093, and NSF-CCR-9322513, and an Alfred P. Sloan Fellowship.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. Journal of Computer and System Sciences, 39:21–50, 1989.

    Article  MathSciNet  Google Scholar 

  2. E. Allender, R. Beigel, U. Hertrampf, and S. Homer. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science, 115:225–241, 1993.

    Article  MathSciNet  Google Scholar 

  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. 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 http://www.cs.rochester.edu/trs/theory-trs.html.

    MATH  Google Scholar 

  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. R. Gavaldà and J. Balcázar. Strong and robustly strong polynomial time reducibilities to sparse sets. Theoretical Computer Science, 88(1):1–14, 1991.

    Article  MathSciNet  Google Scholar 

  7. J. Hartmanis and L. Hemachandra. Robust machines accept easy sets. Theoretical Computer Science, 74(2):217–226, 1990.

    Article  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  9. J. Kadin. PNP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282–298, 1989.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  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. 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. 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.

    Chapter  Google Scholar 

  14. T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1–25, 1982.

    Article  MathSciNet  Google Scholar 

  15. T. Long and A. Selman. Relativizing complexity classes with sparse oracles. Journal of the ACM, 33(3):618–627, 1986.

    Article  MathSciNet  Google Scholar 

  16. A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440–457, 1978.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York at Buffalo, Buffalo, NY, 14260, USA

    Jin-Yi Cai

  2. Department of Computer Science, University of Rochester, Rochester, NY, 14627, USA

    Lane A. Hemaspaandra

  3. Institut für Informatik, Friedrich-Schiller-Universität Jena, 07740, Jena, Germany

    Gerd Wechsung

Authors
  1. Jin-Yi Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lane A. Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerd Wechsung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Information Science, Academia Sinica, 11529, Nankang, Taipei, Taiwan

    Wen-Lian Hsu

  2. Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT, 06520, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, JY., Hemaspaandra, L.A., Wechsung, G. (1998). Robust Reductions. In: Hsu, WL., Kao, MY. (eds) Computing and Combinatorics. COCOON 1998. Lecture Notes in Computer Science, vol 1449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68535-9_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-68535-9_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64824-6

  • Online ISBN: 978-3-540-68535-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation