A complexity theory for feasible closure properties

@article{Ogiwara1991ACT,
  title={A complexity theory for feasible closure properties},
  author={Mitsunori Ogiwara and L. Hemachandra},
  journal={[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference},
  year={1991},
  pages={16-29}
}
The authors propose and develop a complexity theory of feasible closure properties. For each of the classes Hash P, SpanP, OptP, and MidP, they establish complete characterizations-in terms of complexity class collapses-of the conditions under which the class has all feasible closure properties. In particular, Hash P is P-closed if and only if PP=UP; SpanP is P-closed if and only if R-MidP is P-closed if and only if P/sup PP/=NP; and OptP is P-closed if and only if NP=co-NP. Furthermore, for… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

  • Kurt Gödel Colloquium
  • 1997
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Gap-De nable Counting Classes

A. Stephen, FenneryComputer
  • 1991
VIEW 13 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Gap-De nable Counting

ClassesStephen, Arthur John Fenner
  • 1992
VIEW 6 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Gap-deenable Counting Classes

VIEW 6 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED