TY - GEN

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

AU - Ogiwara, Mitsunori

AU - Watanabe, Osamu

PY - 1990/12/1

Y1 - 1990/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0025599316&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025599316&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025599316

SN - 0818620722

T3 - Proc Fifth Annu Struct Complexity Theor

BT - Proc Fifth Annu Struct Complexity Theor

PB - Publ by IEEE

T2 - Proceedings of the Fifth Annual Structure in Complexity Theory Conference

Y2 - 8 July 1990 through 11 July 1990

ER -