On the reducibility of sets inside NP to sets with low information content

Mitsunori Ogihara, Till Tantau

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L:L is the class of all logspace self-reducible sets in LL-sel.

Original languageEnglish (US)
Pages (from-to)499-524
Number of pages26
JournalJournal of Computer and System Sciences
Volume69
Issue number4
DOIs
StatePublished - Dec 2004
Externally publishedYes

Fingerprint

Reducibility
Information Content
Complexity Classes
Graph Automorphism
Satisfiability Problem
Accessibility
Undirected Graph
Low Complexity
Determinant
Branch

Keywords

  • Computational complexity
  • Membership comparability
  • Prover-verifier protocols
  • Selectivity
  • Self-reduction
  • Sets with low information content

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On the reducibility of sets inside NP to sets with low information content. / Ogihara, Mitsunori; Tantau, Till.

In: Journal of Computer and System Sciences, Vol. 69, No. 4, 12.2004, p. 499-524.

Research output: Contribution to journalArticle

@article{bc112d2ec2b647d1905b1a6ba66acb73,
title = "On the reducibility of sets inside NP to sets with low information content",
abstract = "This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L:L is the class of all logspace self-reducible sets in LL-sel.",
keywords = "Computational complexity, Membership comparability, Prover-verifier protocols, Selectivity, Self-reduction, Sets with low information content",
author = "Mitsunori Ogihara and Till Tantau",
year = "2004",
month = "12",
doi = "10.1016/j.jcss.2004.03.003",
language = "English (US)",
volume = "69",
pages = "499--524",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - On the reducibility of sets inside NP to sets with low information content

AU - Ogihara, Mitsunori

AU - Tantau, Till

PY - 2004/12

Y1 - 2004/12

N2 - This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L:L is the class of all logspace self-reducible sets in LL-sel.

AB - This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L:L is the class of all logspace self-reducible sets in LL-sel.

KW - Computational complexity

KW - Membership comparability

KW - Prover-verifier protocols

KW - Selectivity

KW - Self-reduction

KW - Sets with low information content

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

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

U2 - 10.1016/j.jcss.2004.03.003

DO - 10.1016/j.jcss.2004.03.003

M3 - Article

VL - 69

SP - 499

EP - 524

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 4

ER -