NP might not be as easy as detecting unique solutions
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information and Computation
Information and Computation
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
| Hi-index | 0.00 |
The authors introduce symmetric perfect generic sets. These sets vary from the usual generic sets by allowing limited infinite encoding into the oracle. We then show that the Berman--Hartmanis isomorphism conjecture holds relative to any sp-generic oracle, i.e., for any symmetric perfect generic set $A$, all ${\bf NP}^A$-complete sets are polynomial-time isomorphic relative to $A$. Prior to this work, there were no known oracles relative to which the isomorphism conjecture held. As part of the proof that the isomorphism conjecture holds relative to symmetric perfect generic sets, it is also shown that ${\bf P^A} {\bf =} {\bf FewP^A}$ for any symmetric perfect generic $A$.