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

Mitsunori Ogihara, 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
Pages2
Number of pages1
ISBN (Print)0818620722
StatePublished - 1990
Externally publishedYes
EventProceedings of the Fifth Annual Structure in Complexity Theory Conference - Barcelona, Spain
Duration: Jul 8 1990Jul 11 1990

Other

OtherProceedings of the Fifth Annual Structure in Complexity Theory Conference
CityBarcelona, Spain
Period7/8/907/11/90

Fingerprint

Polynomials

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

On polynomial time bounded truth-table reducibility of NP sets to sparse sets. / Ogihara, Mitsunori; Watanabe, Osamu.

Proc Fifth Annu Struct Complexity Theor. Publ by IEEE, 1990. p. 2.

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

Ogihara, M & Watanabe, O 1990, On polynomial time bounded truth-table reducibility of NP sets to sparse sets. in Proc Fifth Annu Struct Complexity Theor. Publ by IEEE, pp. 2, Proceedings of the Fifth Annual Structure in Complexity Theory Conference, Barcelona, Spain, 7/8/90.
Ogihara M, Watanabe O. On polynomial time bounded truth-table reducibility of NP sets to sparse sets. In Proc Fifth Annu Struct Complexity Theor. Publ by IEEE. 1990. p. 2
Ogihara, Mitsunori ; Watanabe, Osamu. / On polynomial time bounded truth-table reducibility of NP sets to sparse sets. Proc Fifth Annu Struct Complexity Theor. Publ by IEEE, 1990. pp. 2
@inproceedings{b408ae4aa0514ea68387027e43dec214,
title = "On polynomial time bounded truth-table reducibility of NP sets to sparse sets",
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.",
author = "Mitsunori Ogihara and Osamu Watanabe",
year = "1990",
language = "English (US)",
isbn = "0818620722",
pages = "2",
booktitle = "Proc Fifth Annu Struct Complexity Theor",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Ogihara, Mitsunori

AU - Watanabe, Osamu

PY - 1990

Y1 - 1990

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

SN - 0818620722

SP - 2

BT - Proc Fifth Annu Struct Complexity Theor

PB - Publ by IEEE

ER -