On polynomial time bounded truth-table reducibility of NP sets to sparse sets

Mitsunori Ogiwara, Osamu Watanabe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

We prove that if P ≠ NP, then there exists a set in NP that is polynomial time bounded truth-table reducible (in short, ≤bttP-reducible) to no sparse set. In other words, we prove that no sparse ≤bttP-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 ≤bttP-reducible to no sparse set.

Original languageEnglish (US)
Title of host publicationProc 22nd Annu ACM Symp Theory Comput
PublisherPubl by ACM
Pages457-467
Number of pages11
ISBN (Print)0897913612, 9780897913614
DOIs
StatePublished - Jan 1 1990
Externally publishedYes
EventProceedings of the 22nd Annual ACM Symposium on Theory of Computing - Baltimore, MD, USA
Duration: May 14 1990May 16 1990

Publication series

NameProc 22nd Annu ACM Symp Theory Comput

Other

OtherProceedings of the 22nd Annual ACM Symposium on Theory of Computing
CityBaltimore, MD, USA
Period5/14/905/16/90

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'On polynomial time bounded truth-table reducibility of NP sets to sparse sets'. Together they form a unique fingerprint.

Cite this