Skip to main content
SpringerLink
Log in

Productive functions and isomorphisms

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

Joseph and Young [5] conjectured that there are non-p-isomorphic NP-complete sets if ak-creative set in NP exists which has no p-invertible p-productive function. We prove that this conjecture is true for the exponential-time (deterministic and nondeterministic) complexity classes E and NE. In particular, we prove that non-p-isomorphic E-complete sets exist if and only if there is a p-creative set in E which has no p-invertible p-productive function. Similar result holds for NE as well.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Berman, Polynomial reducibilities and complete sets, Ph.D. thesis, Cornell University, 1977.

  2. L. Berman and J. Hartmanis, On isomorphisms and density of NP and other complete sets,SIAM J. Comput,6(2) (1977), 305–322.

    Google Scholar 

  3. K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities,Proc. STAGS 89, Lecture Notes in Computer Science, Vol. 349, Springer-Verlag, Berlin, 1989, pp. 240–250.

    Google Scholar 

  4. S. Homer and J. Wang, Immunity of complete problems.Inform. and Comput.,110 (1994), 119–129.

    Google Scholar 

  5. D. Joseph and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP,Theoret. Comput. Sci.,39 (1985), 225–237.

    Google Scholar 

  6. K. Ko, T. Long, and Z. Du, A note on one-way functions and polynomial-time isomorphisms,Theoret. Comput. Sci.,47 (1986), 263–276.

    Google Scholar 

  7. K. Ko and D. Moore, Completeness, approximation and density,SIAM J. Comput.,10 (1981), 787–796.

    Google Scholar 

  8. S. Kurtz, S. Mahaney, and J. Royer, Collapsing Degrees, Tech. Report #86-008, University of Chicago, 1986.

  9. S. Mahaney and P. Young, Reductions among polynomial isomorphism types,Theoret. Comput. Sci.,39 (1985), 207–224.

    Google Scholar 

  10. P. Orponen, D. Russo, and U. Schöming, Optimal approximations and polynomially levelable sets,SIAM J. Comput,15 (1986), 399–408.

    Google Scholar 

  11. A. Selman,One-Way Functions in Complexity Theory, Lecture Notes in Computer Science, Vol. 452, Springer-Verlag, Berlin, 1990, pp. 88–104.

    Google Scholar 

  12. J. Wang, P-creative sets vs, p-completely creative sets,IEEE Proc. 4th Annual Conference on Structure in Complexity Theory, June 1989, pp. 24–33.

  13. J. Wang,Some Remarks on Polynomial Time Isomorphisms, Lecture Notes in Computer Science, Vol. 468, Springer-Verlag, Berlin, 1990, pp. 144–153.

    Google Scholar 

  14. J. Wang, On p-creative sets and p-completely creative sets,Theoret. Comput. Sci.,85 (1991), 1–31.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of North Carolina at Greensboro, 27412, Greensboro, NC, USA

    Jie Wang

Authors
  1. Jie Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported in part by NSF Grants CCR-8814339 and CCR-9108899.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J. Productive functions and isomorphisms. Math. Systems Theory 28, 109–116 (1995). https://doi.org/10.1007/BF01191472

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation