Abstract

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$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.