A complexity theory for feasible closure properties

Mitsunori Ogihara, Lane A. Hemachandra

Research output: Contribution to journalArticle

53 Citations (Scopus)

Abstract

The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets). For the study of the complexity of closure properties, a recent flurry of results has established an analog of (1); these papers explicitly demonstrate many closure properties possessed by PP and C=P (and the proofs implicitly give closure properties of the function class #P). The present paper presents and develops, for function classes such as #P, SpanP, OptP, and MidP, an analog of (2): a general theory of the complexity of closure properties. In particular, we show that subtraction is hard for the closure properties of each of these classes: each is closed under subtraction if and only if it is closed under every polynomial-time operation. Previously, no property-natural or unnatural-had been known to have this behavior. We also prove other natural operations hard for the closure properties of #P, SpanP, OptP, and MidP, and we explore the relative complexity of operations that seem not to be # P-hard, such as maximum, minimum, decrement, and median. Moreover, for each of #P, SpanP, OptP, and MidP, we give a natural complete characterization-in terms of the collapse of complexity classes-of the conditions under which that class has every feasible closure property.

Original languageEnglish (US)
Pages (from-to)295-325
Number of pages31
JournalJournal of Computer and System Sciences
Volume46
Issue number3
DOIs
StatePublished - 1993
Externally publishedYes

Fingerprint

Closure Properties
Complexity Theory
Polynomials
Subtraction
Analogue
Closed
Complexity Classes
Polynomial time
NP-complete problem
If and only if
Class
Demonstrate

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A complexity theory for feasible closure properties. / Ogihara, Mitsunori; Hemachandra, Lane A.

In: Journal of Computer and System Sciences, Vol. 46, No. 3, 1993, p. 295-325.

Research output: Contribution to journalArticle

@article{6cbb8067410c4f60a67cebdb705af154,
title = "A complexity theory for feasible closure properties",
abstract = "The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets). For the study of the complexity of closure properties, a recent flurry of results has established an analog of (1); these papers explicitly demonstrate many closure properties possessed by PP and C=P (and the proofs implicitly give closure properties of the function class #P). The present paper presents and develops, for function classes such as #P, SpanP, OptP, and MidP, an analog of (2): a general theory of the complexity of closure properties. In particular, we show that subtraction is hard for the closure properties of each of these classes: each is closed under subtraction if and only if it is closed under every polynomial-time operation. Previously, no property-natural or unnatural-had been known to have this behavior. We also prove other natural operations hard for the closure properties of #P, SpanP, OptP, and MidP, and we explore the relative complexity of operations that seem not to be # P-hard, such as maximum, minimum, decrement, and median. Moreover, for each of #P, SpanP, OptP, and MidP, we give a natural complete characterization-in terms of the collapse of complexity classes-of the conditions under which that class has every feasible closure property.",
author = "Mitsunori Ogihara and Hemachandra, {Lane A.}",
year = "1993",
doi = "10.1016/0022-0000(93)90006-I",
language = "English (US)",
volume = "46",
pages = "295--325",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - A complexity theory for feasible closure properties

AU - Ogihara, Mitsunori

AU - Hemachandra, Lane A.

PY - 1993

Y1 - 1993

N2 - The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets). For the study of the complexity of closure properties, a recent flurry of results has established an analog of (1); these papers explicitly demonstrate many closure properties possessed by PP and C=P (and the proofs implicitly give closure properties of the function class #P). The present paper presents and develops, for function classes such as #P, SpanP, OptP, and MidP, an analog of (2): a general theory of the complexity of closure properties. In particular, we show that subtraction is hard for the closure properties of each of these classes: each is closed under subtraction if and only if it is closed under every polynomial-time operation. Previously, no property-natural or unnatural-had been known to have this behavior. We also prove other natural operations hard for the closure properties of #P, SpanP, OptP, and MidP, and we explore the relative complexity of operations that seem not to be # P-hard, such as maximum, minimum, decrement, and median. Moreover, for each of #P, SpanP, OptP, and MidP, we give a natural complete characterization-in terms of the collapse of complexity classes-of the conditions under which that class has every feasible closure property.

AB - The study of the complexity of sets encompasses two complementary aims: (1) establishing-usually via explicit construction of algorithms-that sets are feasible, and (2) studying the relative complexity of sets that plausibly might be feasible but are not currently known to be feasible (such as the NP-complete sets and the PSPACE-complete sets). For the study of the complexity of closure properties, a recent flurry of results has established an analog of (1); these papers explicitly demonstrate many closure properties possessed by PP and C=P (and the proofs implicitly give closure properties of the function class #P). The present paper presents and develops, for function classes such as #P, SpanP, OptP, and MidP, an analog of (2): a general theory of the complexity of closure properties. In particular, we show that subtraction is hard for the closure properties of each of these classes: each is closed under subtraction if and only if it is closed under every polynomial-time operation. Previously, no property-natural or unnatural-had been known to have this behavior. We also prove other natural operations hard for the closure properties of #P, SpanP, OptP, and MidP, and we explore the relative complexity of operations that seem not to be # P-hard, such as maximum, minimum, decrement, and median. Moreover, for each of #P, SpanP, OptP, and MidP, we give a natural complete characterization-in terms of the collapse of complexity classes-of the conditions under which that class has every feasible closure property.

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

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

U2 - 10.1016/0022-0000(93)90006-I

DO - 10.1016/0022-0000(93)90006-I

M3 - Article

VL - 46

SP - 295

EP - 325

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 3

ER -