Abstract

We prove that if P # NP, then there exists a set in NP that is polynomial time bounded truth-table reducible (in short, <Ft,-reducible) to no sparse set. In other words, we prove that no sparse <[tt-hard set exists for NP unless P = NP. By using the technique proving this result, we investigate intractability of several number theoretic decision problems, i.e., decision problems defined naturally from number theoretic problems. We show that for those number theoretic decision problems, if it is not in P, then it is _<Ft,-reducible to no sparse set.

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.