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

Abstract

Summary form only given. It is proved that if P ≠ NP, then there exits a set in NP that is polynomial-time bounded truth-table reducible to no sparse set. By using the technique proving this result, intractability of several number theoretic decision problems, i.e., decision problems defined naturally from number theoretic problems, is investigated. It is shown that for those number theoretic decision problems, if it is not in P, then it is polynomial-time bounded truth-table reducible to no sparse set.

Original languageEnglish (US)
Title of host publicationProc Fifth Annu Struct Complexity Theor
PublisherPubl by IEEE
Number of pages1
ISBN (Print)0818620722
StatePublished - Dec 1 1990
Externally publishedYes
EventProceedings of the Fifth Annual Structure in Complexity Theory Conference - Barcelona, Spain
Duration: Jul 8 1990Jul 11 1990

Publication series

NameProc Fifth Annu Struct Complexity Theor

Other

OtherProceedings of the Fifth Annual Structure in Complexity Theory Conference
CityBarcelona, Spain
Period7/8/907/11/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

    Ogiwara, M., & Watanabe, O. (1990). On polynomial time bounded truth-table reducibility of NP sets to sparse sets. In Proc Fifth Annu Struct Complexity Theor (Proc Fifth Annu Struct Complexity Theor). Publ by IEEE.