The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle

Journal of Computer and System Sciences

Volumn 54, Issue 3, 1997, Pages 412-423

  Rogers, John ^a  

^a DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; FUNCTIONS; POLYNOMIALS; THEOREM PROVING;

ISOMORPHISM CONJECTURE; ONE WAY FUNCTIONS; ORACLE RELATIVE; POLYNOMIAL TIME;

COMPUTATIONAL COMPLEXITY;

EID: 0031165678     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1486     Document Type: Article

References (22)

1. L. Berman, "Polynomial Reducibilities and Complete Sets," Ph.D. thesis. Cornell University, 1977.
2. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, in "Proceedings of the 8th ACM Symposium on the Theory of Computing," pp. 30-40, ACM, New York, 1976.
3. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Computing 1 (1977), 305-322.
4. M. Dowd, On isomorphism, unpublished manuscript, 1978.
5. S. Fenner, L. Fortnow, and S. Kurtz, The isomorphism conjecture hold relative to an oracle, SIAM J. Computing 25 (1996), 193-206.
6. S. Fenner, L. Fortnow, S. Kurtz, and L. Li, An oracle builder's toolkit, in "Proceedings of the 8th IEEE Structure in Complexity Theory Conference," pp. 120-131, IEEE, New York, 1993.
7. L. Fortnow and J. Rogers, Separability and one-way functions, in "Proceedings of the 5th International Symposium on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 834, pp. 396-404, Springer-Verlag, New York/Berlin, 1994.
8. J. Geske and J. Grollmann, Relativizations of unambiguous and random polynomial time classes, SIAM J. Computing 15, No. 2 (1986), 511-519.
9. K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities, SIAM J. Computing 21 (1992), 733-742.
10. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
11. J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, SIAM J. Computing 17 (1988), 309-355.
12. J. Hartmanis and L. Hemachandra, One-way functions and the non-isomorphism of NP-complete sets, Theoret. Comput. Sci. 81, No. 1 (1991), 155-163.
13. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA, 1979.
14. D. Joseph and P. Young, Some remarks on witness functions for polynomial reducibilities in NP, Theoret. Comput. Sci. 39 (1985), 225-237.
15. K.-I Ko, T. J. Long, and D.-Z. Du, On one-way functions and polynomial-time isomorphisms, Theoret. Comput. Sci. 47 (1986), 263-276.
16. S. Kurtz, S. Mahaney, and J. Royer, The isomorphism conjecture fails relative to a random oracle, in "Proceedings of the 21st ACM Symposium on the Theory of Computing," pp. 157-166, ACM, New York, 1989.
17. S. Kurtz, S. Mahaney, and J. Royer, "Complexity Theory Retrospective," pp. 108-146, Springer-Verlag, New York, 1990.
18. S. A. Kurtz, "A Relativized Failure of the Berman-Hartmanis Conjecture," Tech. Rep. 83-001, University of Chicago, 1983.
19. M. Li and P. Vitanyi, "An Introduction to Kolmogorov Complexity and Its Applications," Springer-Verlag, New York, 1983.
20. C. Rackoff, Relativized questions involving probablistic algorithms, J. Assoc. Comput. Machin. 29, No. 1 (1982), 261-268.
21. H. Rogers, "Theory of Recursive Functions and Effective Computability," MIT Press, Cambridge, MA, 1987.
22. A. Selman, A survey of one way functions in complexity theory, Math. Systems Theory 25 (1992), 203-221.