Preview
Unable to display preview. Download preview PDF.
7. References
Arvind, V., On some structural properties of NP, Ph. D. thesis, I.I.T. Kanpur, 1987.
Arvind, V. and Biswas, S., Kernel constructible languages, Proc. of the 3rd FST & TCS conference, 1983.
Balcázar, J. L., Self-reducibility, Proc. 4th STACS, Lect. Notes in Comp. Sc., Vol. 247, pp. 136–147, 1987.
Berman, P., Relationships between density and deterministic complexity of NP-complete languages, Proc. 5th ICALP, Lect. Notes in Comp. Sc., vol. 62, pp. 63–71, 1978.
Berman, L. and Hartmanis, J., On isomorphism and density of NP and other complete sets, SIAM Journal of Computing 6, pp. 305–322, 1977.
Fortune, S., A note on sparse complete sets, SIAM Jl. Comput. vol. 8, pp. 431–433, 1979.
Joseph, D. and Young, P., Some remarks on witness functions for nonpolynomial and noncomplete sets in NP, Theor. C. Sc., vol. 39, pp. 225–237, 1985.
Ko, Ker-I, On helping by robust oracle machines, Theor. Comp. Sc., vol. 52, pp. 15–36, 1987.
Mahaney, S., Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, Proc. 21st IEEE Symp. on FOCS, pp. 54–60, 1980. Final version in Jl. of Comp. Syst. Sc., vol. 25, pp. 130–143, 1982.
Meyer, A. R. and Paterson, M. S., With what frequency are apparently intractable problems difficult?, Tech. Report, MIT/LCS/TM-126, 1979.
Mahaney, S. and Young, P., Orderings of polynomial isomorphism types, Theor. Comput. Sc., 39(2), pp. 207–224, 1985.
Schnorr, C.P., On self-transformable combinatorial problems, Math. Programming Study, Vol. 14, pp. 95–103, 1982.
Selman, A., P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Math. Syst. Theory, 13, pp. 55–65, 1979.
Selman, A., Natural self-reducible sets, preprint, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khadilkar, S.N., Biswas, S. (1988). Padding, commitment and self-reducibility. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_82
Download citation
DOI: https://doi.org/10.1007/3-540-50517-2_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50517-4
Online ISBN: 978-3-540-46030-5
eBook Packages: Springer Book Archive