Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1987: STACS 87 pp 136–147Cite as

Self-reducibility

  • Contributed Papers
  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Balcázar, R. Book, U. Schöning: "The polynomial time hierarchy and sparse oracles". J. ACM 33, 3 (1986), 603–617.

    Google Scholar 

  2. P. Berman: "Relationship between density and deterministic complexity of NP-complete languages". ICALP 1978, Springer LNCS 62, 63–71.

    Google Scholar 

  3. A. Chandra, D. Kozen, L. Stockmeyer: "alternation", J. ACM 28, 1 (1981), 114–133.

    Google Scholar 

  4. S. Fortune: "A note on sparse complete sets". SIAM J. Comp. 8, 3 (1979), 431–433.

    Google Scholar 

  5. R. Karp, R. Lipton: "Some connections between non-uniform and uniform complexity classes". 12 ACM STOC, 1982, 302–309.

    Google Scholar 

  6. Ker-I Ko: "On self-reducibility and weak p-selectivity". J. Comp. Sys. Sci. 26, 2 (1983), 209–221.

    Google Scholar 

  7. Ker-I Ko: "On helping by robust oracle machines". Manuscript (1986).

    Google Scholar 

  8. S. Mahaney: "Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis". J. Comp. Sys. Sci. 25 (1982), 130–143.

    Google Scholar 

  9. S. Mahaney: "Sparse sets and reducibilities". In: Studies in complexity theory, ed. R. Book, Pitman 1986.

    Google Scholar 

  10. K. Mehlhorn: Data structures and algorithms, vol. 2 "Graph algorithms and NP-completeness". EATCS Monographs, Springer 1984.

    Google Scholar 

  11. A. Meyer, M. Paterson: "With what frequency are apparently intractable problems difficult?". M.I.T. Technical report TM-126 (1979).

    Google Scholar 

  12. C.P. Schnorr: "Optimal algorithms for self-reducible problems". ICALP 1976, ed. S. Michaelson and R. Milner, Edinburgh Univ. Press, 322–337.

    Google Scholar 

  13. C.P. Schnorr: "On self-transformable combinatorial problems". Symposium on Mathematische Optimierung, Oberwolfach 1979.

    Google Scholar 

  14. U. Schöning: Complexity and structure. Springer LNCS 211, 1986.

    Google Scholar 

  15. A. Selman: "Remarks about natural self-reducible sets in NP and complexity measures for public key cryptosystems". Manuscript (1984).

    Google Scholar 

  16. L. Valiant: "The relative complexity of checking and evaluating". Inf. Proc. Letters 5 (1976), 20–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Informática U.P.C., 08028, Barcelona, Spain

    José L. Balcázar

Authors
  1. José L. Balcázar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balcázar, J.L. (1987). Self-reducibility. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039601

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation