## A Complexity Theory for Feasible Closure Properties (1991)

Citations: | 47 - 3 self |

### BibTeX

@MISC{Ogiwara91acomplexity,

author = {Mitsunori Ogiwara and Lane A. Hemachandra},

title = {A Complexity Theory for Feasible Closure Properties},

year = {1991}

}

### OpenURL

### 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 urry of results [21, 33, 49, 6, 7, 16] 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 polynom...