A complexity theory for feasible closure properties

@article{Ogiwara1993ACT,
  title={A complexity theory for feasible closure properties},
  author={Mitsunori Ogiwara and L. Hemachandra},
  journal={Journal of Computer and System Sciences},
  year={1993},
  volume={46},
  pages={295-325}
}
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… Expand
The Shrinking Property for NP and coNP
TLDR
It is proved that the assumption is too weak to refute the shrinking property for in a relativizable way and an oracle is constructed relative to which, , and has theshrinking property is constructed. Expand
On closure properties of GapP
TLDR
Evidence is given that these function classes GapP and GapP+. Expand
Logical definability of counting functions
  • K. Compton, E. Grädel
  • Mathematics, Computer Science
  • Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory
  • 1994
TLDR
It is shown that on unordered structures every function in P is identical almost everywhere with some function #FO, and similarly for /spl Sigmasub 1/ and spanP, and that FO is not closed under other operations under which P would be closed only if certain generally believed assumptions in complexity theory failed. Expand
Logical De nability of Counting
The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is #P, which consists of the functions counting the acceptingExpand
Complexity Classes of Optimization Functions
TLDR
It is shown how these operators translate closure properties from one class to another, how they relate operators on classes of functions and classes of sets, and how they encode classes of maximum, minimum, or median functions into well-studiedclasses of sets. Expand
Lower bounds and the hardness of counting properties
TLDR
The present paper raises the lower bound for nontrivial counting properties from UPO(1)-hardness to FewP-hardness, and for a broad class of leaf-language classes it is proved a sufficient condition for the natural analog of Rice's Theorem to hold. Expand
Tally NP Sets and Easy Census Functions
TLDR
It is proved that it is no more likely that the census function of any set in P can be approximated than that it can be precisely computed in polynomial time. Expand
Lower Bounds and the Hardness of Counting Properties
TLDR
The lower bound for nontrivial counting properties from UP O (l)-hardness to FewPhardness is raised, and it is proved that this lower bound is rather tight with respect to relativizable techniques, i.e., no relativist technique can raise this higher bound to FewP-≤ 1-tt p -hardness. Expand
The Polynomial Time Function Hierarchy
We study Krentel's polynomial time function hierarchy (PFH) which classiies and characterizes optimization functions using deterministic oracle transducers and NP sets as oracles. We introduce aExpand
The shrinking property for NP and coNP
TLDR
An oracle relative to which [email protected]?coNP, NP coNP, and NP has the shrinking property is constructed, which solves an open question posed by Blass and Gurevich (1984) who explicitly ask for such an oracle. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
On the Structure of Sets in NP and Other Complexity Classes
TLDR
A number of simple tools are developed which facilitate the study of the structure of sets in NP and yield the existence of a minimal pair of sets A, S E NP which are not complete, which can be used to constru@ partial orders of degrees with respect to polynomial time reducibility. Expand
A Note on Structure and Looking Back Applied to the Complexity of Computable Functions
Abstract A strong connection is established between the structural and the looking back techniques for manipulating the relative complexity of computable functions and exploring the nature ofExpand
An oracle characterization of the counting hierarchy
  • J. Torán
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
TLDR
The concept of lowness is extended to the classes in CH, providing a way to characterize the sets that are low for the class PP using ranking functions, and some connections are found between ranking functions and low sets for PP. Expand
Gap-definable counting classes
TLDR
It is shown that most previously studied counting classes are gap-definable, i.e., definable using the values of GapP functions alone, and there is a smallest gap- definable class, SPP, which is still large enough to contain Few. Expand
The Complexity of Optimization Problems
  • M. Krentel
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1988
TLDR
It is shown that TRAVELING SALESPERSON and KNAPSACK are complete for OptP, and that CLIQUE and COLORING arecomplete for a subclass of OptP . Expand
On some central problems in computational complexity.
In this thesis we examine some of the central problems in the theory of computational complexity, like the trade-offs between time and memory, the power of nondeterminism and parallelism, and theExpand
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is aExpand
Turning machines with few accepting computations and low sets for PP
TLDR
The authors prove lowness properties of the class Few and some other interesting sets that are low for the class PP and investigate three subclasses of NP that are high for complexity classes not known to be in the polynomial-time hierarchy. Expand
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
TLDR
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems. Expand
The Boolean Hierarchy I: Structural Properties
TLDR
The complexity of sets formed by boolean operations (union, intersection, and complement) on NP sets are studied, showing that in some relativized worlds the boolean hierarchy is infinite, and that for every k there is a relativization world in which the Boolean hierarchy extends exactly k levels. Expand
...
1
2
3
4
5
...