Skip to main content
Springer Nature Link
Log in

Bounded reductions

  • Complexity II
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

Abstract

We study properties of resource— and otherwise bounded reductions and corresponding completeness notions on nondeterministic time classes which contain exponential time. As it turns out most of these reductions can be separated in the sense that their corresponding completeness notions are different. There is one notable exception. On nondeterministic exponential time 1-truth table and many-one completeness is the same notion.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berman L. On the structure of complete sets. Proc. 17th IEEE conference on Foundations of Computer Science (1976) pp76–80.

    Google Scholar 

  2. Buhrman H., S. Homer & L. Torenvliet. Honest reductions, completeness and nondeterministic complexity classes. Report CT-89-08, University of Amsterdam, Dept. of Computer Science.

    Google Scholar 

  3. Buhrman H., E. Spaan & L. Torenvliet. On Adaptive Resource Bounded Computations. Report CT-89-08, University of Amsterdam, Dept. of Computer Science.

    Google Scholar 

  4. Cook, S. A. The complexity of theorem-proving procedures. Proc. 3d ACM Symp. on Theory of Computing, Assoc. for Computing Machinery, New York (1971) pp151–158.

    Google Scholar 

  5. Homer, S. Personal communication.

    Google Scholar 

  6. Karp, R.M. Reducibility among combinatorial problems. Complexity of Computer Computations, R.E. Miller & J.W. Thatcher eds. Plenum N.Y. pp85–103.

    Google Scholar 

  7. Ladner R.E. & N.A. Lynch. Relativization of Questions About Log Space Computability. Mathematical Systems Theory 10 (1976) pp19–32.

    Article  Google Scholar 

  8. Ladner, R.E., N. Lynch & A.L. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science 1 (1975) 103–123.

    Article  Google Scholar 

  9. Soare, R.I. Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer-Verlag (1987) pp60–61.

    Google Scholar 

  10. Watanabe, O. A comparison of polynomial time completeness notions. Theoretical Computer Science 54 (1987) pp249–265.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Mathematic and Computer Science, University of Amsterdam, Plantage Muidergracht, 1018 TV, Amsterdam, The Netherlands

    Harry Buhrman, Edith Spaan & Leen Torenvliet

Authors
  1. Harry Buhrman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edith Spaan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leen Torenvliet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buhrman, H., Spaan, E., Torenvliet, L. (1991). Bounded reductions. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020816

Download citation

  • DOI: https://doi.org/10.1007/BFb0020816

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics