Generalized theorems on relationships among reducibility notions to certain complexity classes

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper we give several generalized theorems concerning reducibility notions to certain complexity classes. We study classes that are either (I) closed under NP many-one reductions and polynomial-time conjunctive reductions or (II) closed under coNP many-one reductions and polynomial-time disjunctive reductions. We prove that, for such a class K, (1) reducibility notions of sets to K under polynomial-time constant-round truth-table reducibility, polynomial-time log-Turing reducibility, logspace constant-round truth-table reducibility, logspace log-Turing reducibility, and logspace Turing reducibility are all equivalent and (2) every set that is polynomial-time positive Turing reducible to a set in K is already in K. From these results, we derive some observations on the reducibility notions to C=P and NP.

Original languageEnglish (US)
Pages (from-to)189-200
Number of pages12
JournalMathematical Systems Theory
Volume27
Issue number3
DOIs
StatePublished - May 1994
Externally publishedYes

Fingerprint

Complexity Classes
Reducibility
Polynomials
Turing
Polynomial time
Theorem
Truth table
Closed
Relationships
Time Constant

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Mathematics(all)
  • Computational Theory and Mathematics

Cite this

Generalized theorems on relationships among reducibility notions to certain complexity classes. / Ogihara, Mitsunori.

In: Mathematical Systems Theory, Vol. 27, No. 3, 05.1994, p. 189-200.

Research output: Contribution to journalArticle

@article{13836aff9d804094b350238174c3381b,
title = "Generalized theorems on relationships among reducibility notions to certain complexity classes",
abstract = "In this paper we give several generalized theorems concerning reducibility notions to certain complexity classes. We study classes that are either (I) closed under NP many-one reductions and polynomial-time conjunctive reductions or (II) closed under coNP many-one reductions and polynomial-time disjunctive reductions. We prove that, for such a class K, (1) reducibility notions of sets to K under polynomial-time constant-round truth-table reducibility, polynomial-time log-Turing reducibility, logspace constant-round truth-table reducibility, logspace log-Turing reducibility, and logspace Turing reducibility are all equivalent and (2) every set that is polynomial-time positive Turing reducible to a set in K is already in K. From these results, we derive some observations on the reducibility notions to C=P and NP.",
author = "Mitsunori Ogihara",
year = "1994",
month = "5",
doi = "10.1007/BF01578841",
language = "English (US)",
volume = "27",
pages = "189--200",
journal = "Theory of Computing Systems",
issn = "1432-4350",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - Generalized theorems on relationships among reducibility notions to certain complexity classes

AU - Ogihara, Mitsunori

PY - 1994/5

Y1 - 1994/5

N2 - In this paper we give several generalized theorems concerning reducibility notions to certain complexity classes. We study classes that are either (I) closed under NP many-one reductions and polynomial-time conjunctive reductions or (II) closed under coNP many-one reductions and polynomial-time disjunctive reductions. We prove that, for such a class K, (1) reducibility notions of sets to K under polynomial-time constant-round truth-table reducibility, polynomial-time log-Turing reducibility, logspace constant-round truth-table reducibility, logspace log-Turing reducibility, and logspace Turing reducibility are all equivalent and (2) every set that is polynomial-time positive Turing reducible to a set in K is already in K. From these results, we derive some observations on the reducibility notions to C=P and NP.

AB - In this paper we give several generalized theorems concerning reducibility notions to certain complexity classes. We study classes that are either (I) closed under NP many-one reductions and polynomial-time conjunctive reductions or (II) closed under coNP many-one reductions and polynomial-time disjunctive reductions. We prove that, for such a class K, (1) reducibility notions of sets to K under polynomial-time constant-round truth-table reducibility, polynomial-time log-Turing reducibility, logspace constant-round truth-table reducibility, logspace log-Turing reducibility, and logspace Turing reducibility are all equivalent and (2) every set that is polynomial-time positive Turing reducible to a set in K is already in K. From these results, we derive some observations on the reducibility notions to C=P and NP.

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

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

U2 - 10.1007/BF01578841

DO - 10.1007/BF01578841

M3 - Article

AN - SCOPUS:0039271615

VL - 27

SP - 189

EP - 200

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 3

ER -