# The isomorphism conjecture fails relative to a random oracle

@article{Kurtz1995TheIC, title={The isomorphism conjecture fails relative to a random oracle}, author={S. Kurtz and S. Mahaney and J. Royer}, journal={J. ACM}, year={1995}, volume={42}, pages={401-420} }

Berman and Hartmanis [1977] conjectured that there is a polynomial-time computable isomorphism between any two languages complete for NP with respect to polynomial-time computable many-one (Karp) reductions. Joseph and Young [1985] gave a structural definition of a class of NP-complete sets-the k-creative sets-and defined a class of sets (the K f k 's) that are necessarily k-creative. They went on to conjecture that certain of these K f t 's are not isomorphic to the standard NP-complete sets… Expand

#### Topics from this paper

#### Paper Mentions

#### 60 Citations

One-Way Functions and the Isomorphism Conjecture

- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2009

On the Isomorphism Conjecture for Weak Reducibilities

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 1996

One-Way Functions and the Isomorphism Conjecture

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1994

The isomorphism conjecture holds and one-way functions exist relative to an oracle

- Mathematics, Computer Science
- Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
- 1995

One-Way Functions and the Berman-Hartmanis Conjecture

- Mathematics, Computer Science
- 2009 24th Annual IEEE Conference on Computational Complexity
- 2009

Isomorphisms of NP complete problems on random instances

- Mathematics, Computer Science
- [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
- 1993

#### References

Measure and categoiy, 2nd ed

- Springer-Verlag, New York.
- 1980