Skip to main content
SpringerLink
Log in

Some remarks on polynomial time isomorphisms

  • Theory Of Computing, Algorithms And Programming
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '90 (ICCI 1990)

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

Included in the following conference series:

Abstract

Joseph and Young [JY-85] hypothesized that the Berman-Hartmanis isomorphism conjecture fails if there exists a k-completely creative set in NP with no p-invertible p-completely productive functions. We verify this hypothesis for DEXT based on new results of p-creative sets in [Wan-89]. In particular, we prove that the isomorphism conjecture for DEXT fails iff there is a p-creative set for P in DEXT with no p-invertible p-productive functions.

This work was supported in part by NSF grant CCR-8814339 and a Boston University Presidential Fellowship.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. K. Ganesan, Complete problems, creative sets and isomorphism conjectures, Ph.D. thesis, Boston University, 1989.

    Google Scholar 

  3. J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, SIAM J. Comput., 17(1988) 309–335.

    Google Scholar 

  4. 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 

  5. K. Ko, T. Long, and D. Du, A note on one-way functions and polynomial-time isomorphisms, Theoretical Computer Science, 47(1986) 263–276.

    Google Scholar 

  6. S. Kurtz, S. Mahaney, and J. Royer, Collapsing Degrees, University of Chicago, TR-86-006, 1986.

    Google Scholar 

  7. S. Mahaney and P. Young, Reductions among polynomial isomorphism types, Theoretical Computer Science, 39(1985) 207–224.

    Google Scholar 

  8. J. Myhill, Creative Sets, ZML 1(1955) 97–103.

    Google Scholar 

  9. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book, 1967.

    Google Scholar 

  10. J. Wang, On p-creative sets and p-completely creative sets, to appear in Theoretical Computer Science. The earlier version of this paper appeared in IEEE Proceedings of the 4th Annual Conference on Structure in Complexity Theory, June 1989, 24–33.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, CLA, Boston University, 02215, Boston, MA

    Jie Wang

Authors
  1. Jie Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. G. Akl F. Fiala W. W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, J. (1991). Some remarks on polynomial time isomorphisms. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-53504-7_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53504-1

  • Online ISBN: 978-3-540-46677-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation