Keywords
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.
Extended abstract, october 1986
Preview
Unable to display preview. Download preview PDF.
References
J.L. Balcázar, R. Book, U. Schöning: "The polynomial time hierarchy and sparse oracles". J. ACM 33, 3 (1986), 603–617.
P. Berman: "Relationship between density and deterministic complexity of NP-complete languages". ICALP 1978, Springer LNCS 62, 63–71.
A. Chandra, D. Kozen, L. Stockmeyer: "alternation", J. ACM 28, 1 (1981), 114–133.
S. Fortune: "A note on sparse complete sets". SIAM J. Comp. 8, 3 (1979), 431–433.
R. Karp, R. Lipton: "Some connections between non-uniform and uniform complexity classes". 12 ACM STOC, 1982, 302–309.
Ker-I Ko: "On self-reducibility and weak p-selectivity". J. Comp. Sys. Sci. 26, 2 (1983), 209–221.
Ker-I Ko: "On helping by robust oracle machines". Manuscript (1986).
S. Mahaney: "Sparse complete sets for NP: solution of a conjecture by Berman and Hartmanis". J. Comp. Sys. Sci. 25 (1982), 130–143.
S. Mahaney: "Sparse sets and reducibilities". In: Studies in complexity theory, ed. R. Book, Pitman 1986.
K. Mehlhorn: Data structures and algorithms, vol. 2 "Graph algorithms and NP-completeness". EATCS Monographs, Springer 1984.
A. Meyer, M. Paterson: "With what frequency are apparently intractable problems difficult?". M.I.T. Technical report TM-126 (1979).
C.P. Schnorr: "Optimal algorithms for self-reducible problems". ICALP 1976, ed. S. Michaelson and R. Milner, Edinburgh Univ. Press, 322–337.
C.P. Schnorr: "On self-transformable combinatorial problems". Symposium on Mathematische Optimierung, Oberwolfach 1979.
U. Schöning: Complexity and structure. Springer LNCS 211, 1986.
A. Selman: "Remarks about natural self-reducible sets in NP and complexity measures for public key cryptosystems". Manuscript (1984).
L. Valiant: "The relative complexity of checking and evaluating". Inf. Proc. Letters 5 (1976), 20–23.
Author information
Authors and Affiliations
Editor information
Rights 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