Padding, commitment and self-reducibility

  • Sanjeev N. Khadilkar
  • Somenath Biswas
Session 7 Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 338)


Polynomial Time Leaf Node Fixed Polynomial Conjunctive Normal Form Hamiltonian Circuit 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. -[A87]-
    Arvind, V., On some structural properties of NP, Ph. D. thesis, I.I.T. Kanpur, 1987.Google Scholar
  2. -[AB83]-
    Arvind, V. and Biswas, S., Kernel constructible languages, Proc. of the 3rd FST & TCS conference, 1983.Google Scholar
  3. -[Ba87]-
    Balcázar, J. L., Self-reducibility, Proc. 4th STACS, Lect. Notes in Comp. Sc., Vol. 247, pp. 136–147, 1987.Google Scholar
  4. -[Be78]-
    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.Google Scholar
  5. -[BH77]-
    Berman, L. and Hartmanis, J., On isomorphism and density of NP and other complete sets, SIAM Journal of Computing 6, pp. 305–322, 1977.Google Scholar
  6. -[F79]-
    Fortune, S., A note on sparse complete sets, SIAM Jl. Comput. vol. 8, pp. 431–433, 1979.Google Scholar
  7. -[JY85]-
    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.Google Scholar
  8. -[Ko87]-
    Ko, Ker-I, On helping by robust oracle machines, Theor. Comp. Sc., vol. 52, pp. 15–36, 1987.Google Scholar
  9. -[M80]-
    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.Google Scholar
  10. -[MP79]-
    Meyer, A. R. and Paterson, M. S., With what frequency are apparently intractable problems difficult?, Tech. Report, MIT/LCS/TM-126, 1979.Google Scholar
  11. -[MY85]-
    Mahaney, S. and Young, P., Orderings of polynomial isomorphism types, Theor. Comput. Sc., 39(2), pp. 207–224, 1985.Google Scholar
  12. -[Sc81]-
    Schnorr, C.P., On self-transformable combinatorial problems, Math. Programming Study, Vol. 14, pp. 95–103, 1982.Google Scholar
  13. -[Se79]-
    Selman, A., P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP, Math. Syst. Theory, 13, pp. 55–65, 1979.Google Scholar
  14. -[Se86]-
    Selman, A., Natural self-reducible sets, preprint, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Sanjeev N. Khadilkar
    • 1
  • Somenath Biswas
    • 1
  1. 1.Dept. of Computer Science and EngineeringI.I.T. KanpurIndia

Personalised recommendations