Skip to main content
SpringerLink
Log in

On disjunctive self-reducibility

  • Conference paper
  • First Online:
Book cover CSL '88 (CSL 1988)

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

Included in the following conference series:

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. E.W. Allender, The complexity of sparse sets in NP, 1st Struct. in Compl. Theory Conf. (1986), LNCS 223, 1–11.

    Google Scholar 

  2. K. Ambos-Spies, Inhomogeneouties in polynomial-time degrees: The degrees of super sparse sets, IPL 22 (1986), 113–117.

    Article  Google Scholar 

  3. K. Ambos-Spies, Polynomial degrees of NP-sets, in Current Trends in Theoretical Computer Science, Comput. Sci. Press (1987).

    Google Scholar 

  4. K. Ambos-Spies, Honest polynomial time reducibilities and the P=?NP problem, to appear in JCSS.

    Google Scholar 

  5. T.P. Baker, J. Gill, R. Solovay, Relativizations of the P=NP question, SIAM JC 4 (1975), 431–442.

    Article  Google Scholar 

  6. J.L. Balcazar, Self-reducibility, STACS 1987, LNCS 247, 136–147.

    Google Scholar 

  7. J.L. Balcazar, J. Diaz, J. Gabarro, monographie (manuscript).

    Google Scholar 

  8. P. Berman, Relationship between density and deterministic complexity of NP-complete languages, 5th ICALP (1978), LNCS 62, 63–71.

    Google Scholar 

  9. R.V. Book, Tally languages and complexity classes, I & C 26 (1974), 186–193.

    Google Scholar 

  10. S.A. Cook, The complexity of theorem proving procedures, 3rd STOC (1971), 151–158.

    Google Scholar 

  11. J. Hartmanis, On sparse sets in NP-P, IPL 16 (1983), 55–60

    Article  Google Scholar 

  12. J. Hartmanis, L. Hemachandra, On sparse oracles seperating feasible complexity classes, Cornell Univ. Ithaca TR 85-707, New York (1985).

    Google Scholar 

  13. J.Hartmanis, V. Sewelson, N. Immerman, Sparse sets in NP-P; Exptime versus Nexptime, 15th STOC (1983), 382–391.

    Google Scholar 

  14. J. Kämper, Non-uniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes, Univ. Oldenburg TR 3 (1987).

    Google Scholar 

  15. R.M. Karp, R.J. Lipton, Some connections between nonuniform and uniform complexity classes, 12th STOC (1980), 302–309.

    Google Scholar 

  16. K. Ko, On self-reducibility and weak p-selectivity, JCSS 26 (1983), 209–221.

    Google Scholar 

  17. K. Ko, On helping by robust oracle machines, 2nd Struct. in Compl. Theory Conf. (1987), 182–190.

    Google Scholar 

  18. R.E. Ladner, On the structure of polynomial time reducibility, JACM 22 (1975), 155–171.

    Article  Google Scholar 

  19. R.E. Ladner, A. Lynch, A.L. Selman, A comparison of polynomial time reducibilities, TCS 1 (1975), 103–123.

    Article  Google Scholar 

  20. L.H. Landweber, R.J. Lipton, E.L. Robertson, On the structure of sets in NP and other complexity classes, Univ. of Wisconsin, Madison, TR 342 (1978).

    Google Scholar 

  21. S.R. Mahaney, Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis, 21st FOCS (1980), 54–60.

    Google Scholar 

  22. A.R. Meyer, M.S. Paterson, With what frequency are apparently intractable problems difficult?, MIT TR Feb. 1979.

    Google Scholar 

  23. C.P. Schnorr, Optimal algorithms for self-reducibl problems, ICALP 1976.

    Google Scholar 

  24. U. Schöning, A uniform approach to obtain diagonal sets in complexity classes, TCS 18 (1982), 95–103.

    Article  Google Scholar 

  25. U. Schöning, A low and a high hierarchy within NP, JCSS 27 (1983), 14–28.

    Google Scholar 

  26. U. Schöning, Complexity and Structure, LNCS 211, Springer (1986).

    Google Scholar 

  27. U. Schöning, Graph isomorphism is in the low hierarchy, STACS (1987), LNCS 247, 114–124.

    Google Scholar 

  28. U. Schöning, Robust oracle machines, manuscript (1988).

    Google Scholar 

  29. A.L. Selman, Analogous of semirecursive sets and effective reducibilities to the study of NP complexity, I & C 52 (1982), 36–51.

    Google Scholar 

  30. A.L. Selman, Natural Self-reducible sets, SIAM J. Comput. 17 (1988) 989–996.

    Article  Google Scholar 

  31. K. Wagner, G. Wechsung, Comutational Complexity, VEB Deutscher Verlag der Wissenschaften, Berlin (1986).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität Heidelberg, Germany

    Klaus Ambos-Spies

  2. Fachbereich Informatik, Universität Oldenburg, Germany

    Jürgen Kämper

Authors
  1. Klaus Ambos-Spies
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Kämper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambos-Spies, K., Kämper, J. (1989). On disjunctive self-reducibility. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026292

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46736-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation