The isomorphism conjecture holds relative to an oracle

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 30-39

  Fenner, Stephen ^a   Fortnow, Lance ^b   Kurtz, Stuart A ^b  

^a UNIVERSITY OF SOUTHERN MAINE   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

COMPLETE SETS; POLYNOMIAL-TIME;

SET THEORY;

EID: 0040812619     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267821     Document Type: Conference Paper

References (14)

1. 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, pages 30-40. ACM, New York, 1976.
2. L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM Journal on Computing, 1:305-322, 1977.
3. M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 118-126. IEEE, New York, 1987.
4. J. Goldsmith and D. Joseph. Three results on the polynomial isomorphism of complete sets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 390-397. IEEE, New York, 1986.
5. J. Grollmann and A Selman. Complexity measures for public-key cryp-tosystems. SIAM Journal on Computing, 17:309-355, 1988.
6. J. Hartmanis and L. Hemachandra. One-way functions and the nonisomor-phism of NP-complete sets. Theoretical Computer Science, 81(1):155-163, 1991.
7. S. Homer and A. Selman. Oracles for structural properties: The isomorphism problem and public-key cryptography. In Proceedings of the 4th IEEE Structure in Complexity Theory Conference, pages 3-14. IEEE, New York, 1989.
8. S. Homer and A. Selman. Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences, 44(2):287-301, 1992.
9. D. Joseph and P. Young. Self-reducibility: Effects of internal structure on computational complexity. In A. Selman, editor, Complexity Theory Retrospective, pages 82-107. Springer, 1990.
10. S. Kurtz, S. Mahaney, and J. Royer. Progress on collapsing degrees. In Proceedings of the 2nd IEEE Structure in Complexity Theory Conference, pages 126-131. IEEE, New York, 1987.
11. S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails to a random oracle. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 157-166. ACM, New York, 1989.
12. S. Kurtz, S. Mahaney, and J. Royer. The structure of complete degrees. In A. Selman, editor, Complexity Theory Retrospective, pages 82-107. Springer, 1990.
13. S. Kurtz. The isomorphism conjecture fails relative to a generic oracle. Technical Report 88-018, Department of Computer Science, University of Chicago, 1988. Accepted for publication to TCS.
14. M. Li and P. Vitanyi. Applications of Kolmogorov complexity in the theory of computation. In A. Selman, editor, Complexity Theory Retrospective, pages 147-203. Springer, 1990.