Skip to main content

The isomorphism conjecture and its generalizations

  • 311 Accesses

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1429)

Keywords

  • Exponential Time
  • Isomorphism Problem
  • Recursion Theory
  • Polynomial Reducibility
  • Polynomial Time Computable Function

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allender, E.W., Isomorphisms and 1-1 reductions, Proceeding of the Structure in Complexity Theory Conference, Springer-Verlag Lecture Notes in Computer Science (1986), pp. 12–22.

    Google Scholar 

  2. Berman, L., Polynomial reducibilities and complete sets, Ph.D. Thesis, Cornell University, 1977.

    Google Scholar 

  3. Berman, L. and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Computing 6 (1977). pp. 305–322.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Dowd, M, On isomorphism, manuscript, 1978.

    Google Scholar 

  5. Ganesan, K. and S. Homer, Complete problems and strong polynomial reducibilities, Boston University Tech. Report #88-001, January 1988.

    Google Scholar 

  6. Goldsmith, J., and D. Joseph, Three results of the polynomial isomorphism of complete sets, Proc. 27th Ann. IEEE Symp. Found. of Comp. Sci., 1896, 390–397.

    Google Scholar 

  7. Homer, S., and A. Selman, Oracles for structural properties: The isomorphism conjecture and public-key cryptography, manuscript, 1988.

    Google Scholar 

  8. Joseph, D., and P. Young, Some remarks on witness functions for non-polynomial and non-complete sets in NP, Theor. Comp. Sci., 39, 1985, 225–237.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Ko, K., T. Long and D. Du, A note on one-way functions and polynomial-time isomorphisms, Theoretical Computer Science, 1986, to appear.

    Google Scholar 

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

    Google Scholar 

  11. Kurtz, S., S. Mahaney, and J. Royer, Collapsing Degrees, Technical Report TR 86-008, University of Chicago, October 1986.

    Google Scholar 

  12. Kurtz, S., S. Mahaney, and J. Royer, On Collapsing Degrees in NP, PSPACE and Σ p2 , Technical Report, University of Chicago, 1987.

    Google Scholar 

  13. Kurtz, S., A relativized failure of the Berman-Hartmanis conjecture, manuscript, 1983.

    Google Scholar 

  14. Ladner, R., N. Lynch and A. Selman, A comparison of polynomial-time reducibilities, Theor. Comp. Sci. 15, 1981, 181–200.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. Mahaney, S., On the number of p-isomorphism classes of NP-complete sets, Proc. 22nd Ann. IEEE symp. Found. of Comp. Sci., pp. 271–278, 1981.

    Google Scholar 

  16. Mahaney, S., Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis, JCSS, (1982), pp. 130–143.

    Google Scholar 

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

    Google Scholar 

  18. Myhill, J., Creative sets, Zeitshrift fur Math. Logik und Grundlagen der Mathematik (1955), pp. 97–108.

    Google Scholar 

  19. Slaman, T., Aspects of E-recursion, Ph.D. Thesis, Harvard University, 1981.

    Google Scholar 

  20. Watenabe, O., On one-one p-equivalence relations, Theoretical Computer Science, (1985), pp. 157–165.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Homer, S. (1990). The isomorphism conjecture and its generalizations. In: Odifreddi, P. (eds) Logic and Computer Science. Lecture Notes in Mathematics, vol 1429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0093922

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52734-3

  • Online ISBN: 978-3-540-47135-6

  • eBook Packages: Springer Book Archive