Abstract
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondeterministic reductions. We show that if an NP-complete set is bounded truth-table reducible to some set that conjunctively reduces to a sparse set then P=NP. We next show that if an NP-complete set is bounded truth-table reducible to some set that randomly reduces (via a co-rp reduction) to some set that conjunctively reduces to a sparse set then RP=NP. Finally, we prove that if a coNP-complete set reduces via a nondeterministic polynomial time many-one reduction to a co-sparse set then PH=Θ 2 p . On the other hand, we show that nondeterministic polynomial time many-one reductions to sparse sets are as powerful as nondeterministic Turing reductions to sparse sets.
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 callDisclaimer: 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.
