On the isomorphism conjecture for weak reducibilities

Journal of Computer and System Sciences

Volumn 53, Issue 2, 1996, Pages 267-282

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; EQUIVALENCE CLASSES; FUNCTIONS; POLYNOMIALS;

ISOMORPHISM CONJECTURE; WEAK REDUCIBILITIES;

COMPUTATIONAL COMPLEXITY;

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

References (23)

1. M. Agrawal and S. Biswas, Polynomial isomorphism of 1-L-complete sets in "Proceedings of the Structure in Complexity Theory Conference, 1993," pp. 75-80.
2. E. Attender, J. Balcázar, and N. Immerman, A first-order isomorphism theorem, in "Proceedings of the Symposium on Theoretical Aspects of Computer Science, 1993."
3. E. W. Allender, Isomorphisms and 1-L reductions, J. Comput. System Sci. 36, No. 6 (1988), 336-350.
4. L. Berman, "Polynomial Reducibilities and Complete Sets," Ph.D. thesis, Cornell University, 1977.
5. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Computing 1 (1977), 305-322.
6. H. Burtschick and A. Hoene, The degree structure of 1-L reductions, in "Proceedings of Math. Foundation of Computer Science," Springer Lecture Notes in Computer Science, Vol. 629, pp. 153-161, Springer-Verlag, 1992.
7. S. Fenner, L. Fortnow, and S. Kurtz, The isomorphism conjecture holds relative to an oracle, in "Proceedings of FOCS, 1992," pp. 30-39.
8. M. Furst, J. Saxe, and M. Sipser, Parity, circuits and the polynomial time hierarchy, Math. Systems Theory 17 (1984), 13-27.
9. K. Ganesin and S. Homer, Complete problems and strong polynomial reducibilities, in "Proceedings of the Symposium on Theoretical Aspects of Computer Science," Springer Lecture Notes in Computer Sciences, Vol. 349, pp. 240-250, Springer-Verlag, New York/Berlin, 1988.
10. J. Grollmann and A. Selman, Complexity measures for public-key cryptosystems, in "Proceedings of FOCS, 1984," pp. 495-503.
11. J. Hartmanis, On log-tape isomorphisms of complete sets, Theoret. Comput. Sci. (1978), 273-286.
12. J. Hartmanis, N. Immerman, and S. Mahaney, One-way log-tape reductions, in "Proceedings of FOCS 1978," pp. 65-72.
13. L. A. Hemchandra and A. Hoene, Collapsing degrees via strong computation, J. Comput. System Sci. 46 No. 3 (1993), 363-380.
14. N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988), 935-938.
15. D. Joseph and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP, Theoret. Comput. Sci. 39 (1985), 225-237.
16. K. Ko, On some natural complete operators, Theoret. Comput. Sci. 37 (1985), 1-30.
17. S. Kurtz, S. Mahaney, and J. Royer, The structure of complete degrees, in "Complexity Theory Retrospective" (A. Selman, Ed.), pp. 108-146, Springer-Verlag, New York/Berlin, 1988.
18. S. Kurtz, S. Mahaney, and J. Royer, The isomorphism conjecture fails relative to a random oracle, in "Proceedings of STOC, 1989," pp. 157-166.
19. S. Kurtz, S. Mahaney, and J. Royer, Average dependence and random oracles, in "Proceedings of the Structure in Complexity Theory Conference, 1992," pp. 306-317.
20. A. L. Selman, A survey of one-way functions in complexity theory, Math. Systems Theory 25 (1992), 203-221.
21. L. J. Stockmeyer, "The Complexity of Decision Problems in Automata Theory and logic," Ph.D. thesis, Massachusetts Institute of Technology, 1974.
22. R. Szelepcsényi, The method of forced enumeration for nondeter-ministic automata, Acta Informatica 26 (1988), 279-284.
23. O. Watanabe, On one-one polynomial time equivalence relations, Theoret. Comput. Sci. 38 (1985), 157-165.