Skip to main content
SpringerLink
Log in

One-way functions and isomorphism conjecture

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992)

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

Abstract

The isomorphism hypothesis is investigated for exponential time and other complexity classes. We present a type of one-way function whose existence is equivalent to the isomorphism hypothesis for deterministic exponential time. We prove that the isomorphism hypothesis holds for E (NE) if and only if it holds for EXP (NEXP).

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. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 1988.

    Google Scholar 

  2. L. Berman. Polynomial Reducibilities and Complete Sets. PhD thesis, Cornell University, 1977.

    Google Scholar 

  3. L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM J. of Comput., 1:305–322, 1977.

    Article  Google Scholar 

  4. K. Ganesan and Steven Homer. Complete problmes and strong polynomial reducibilities. To appear in SICOMP, 1992.

    Google Scholar 

  5. D. Joseph and P. Young. Some remarks on witness functions for polynomial reducibilities in NP. Theoretical Computer Science, 39:225–237, 1985.

    Article  Google Scholar 

  6. K. Ko, T. Long, and D. Du. A note on one-way functions and polynomial-time isomorphisms. Theoretical Computer Science, 47:263–276, 1987.

    Article  Google Scholar 

  7. S. Kurtz, R. Mahaney, and S. Royer. Collapsing degrees. J. Comput. Syst. Sci., 37:247–268, 1988.

    Article  Google Scholar 

  8. S. Kurtz, R. Mahaney, and S. Royer. The structure of complete degrees. In A. Selman, editor, Complexity Theory Retrospective, pages 108–146. Springer-Verlag, 1988.

    Google Scholar 

  9. S. Kurtz, R. Mahaney, and S. Royer. The isomorphism conjecture fails relative to a random oracle. In Proc. of the 21st ACM Symp. on Theory of Computing, pages 157–166, 1989.

    Google Scholar 

  10. Jie Wang. P-creative sets vs. P-completely creative sets. In Proc. of 4th the IEEE Structure in Complexity Theory Conf., pages 24–33, 1989.

    Google Scholar 

  11. Jie Wang. Some remarks on polynomial time isomorphisms. In ICCI, Lecture Notes in Computer Science, volume #468, pages 144–153, 1990.

    Google Scholar 

  12. O. Watanabe. On one-one polynomial time equivalence relations. Theoretical Computer Science, 38:157–165, 1985.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Florida Atlantic University, 33431-0991, Boca Raton, FL

    K. Ganesan

Authors
  1. K. Ganesan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganesan, K. (1992). One-way functions and isomorphism conjecture. In: Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1992. Lecture Notes in Computer Science, vol 652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56287-7_102

Download citation

  • DOI: https://doi.org/10.1007/3-540-56287-7_102

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56287-0

  • Online ISBN: 978-3-540-47507-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation