The isomorphism conjecture holds relative to an oracle

@article{Fenner1992TheIC,
  title={The isomorphism conjecture holds relative to an oracle},
  author={Stephen A. Fenner and L. Fortnow and S. Kurtz},
  journal={Proceedings., 33rd Annual Symposium on Foundations of Computer Science},
  year={1992},
  pages={30-39}
}
The authors introduce symmetric perfect generic sets. these sets vary from the usual generic sets by allowing limited infinite encoding into the oracle. They then show that the Berman-Hartmanis (1977) isomorphism conjecture holds relative to any sp-generic oracle, i.e., for any symmetric perfect generic set A, all NP/sup A/-complete sets are polynomial-time isomorphic relative to A. As part of the proof that the isomorphism conjecture holds relative to symmetric perfect generic sets they also… Expand
The isomorphism conjecture holds and one-way functions exist relative to an oracle
  • J. Rogers
  • Mathematics, Computer Science
  • Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference
  • 1995
On the isomorphism problem for weak reducibilities
  • Manindra Agrawal
  • Mathematics, Computer Science
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
On the NP-Isomorphism Problem with Respect to Random Instances
On the Isomorphism Conjecture for Weak Reducibilities
Inverting onto functions
Inverting onto functions
Polynomial-Time Isomorphism of 1-L-Complete Sets
On oracle builder's toolkit
...
1
2
...

References

SHOWING 1-10 OF 10 REFERENCES
The isomorphic conjecture fails relative to a random oracle
  • S. Kurtz, S. Mahaney, J. Royer
  • Mathematics, Computer Science
  • [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
  • 1989
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography
Generic oracles and oracle classes
  • M. Blum, R. Impagliazzo
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
Three results on the polynomial isomorphism of complete sets
  • J. Goldsmith, D. Joseph
  • Mathematics, Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986
On Isomorphisms and Density of NP and Other Complete Sets
One-Way Functions and the Nonisomorphism of NP-Complete Sets
Complexity Measures for Public-Key Cryptosystems
Progress on collapsing degrees