AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the hierarchy are characterized using polynomially bounded quantifiers. Using this result, a sequence of complete sets for the hierarchy is exhibited
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractIn a previous paper the present authors (Baier and Wagner, 1996) investigated an ∃-∀-hierarc...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations o...
AbstractVarious sets of Turing machines naturally occuring in the theory of computational complexity...
AbstractWe consider the relation between the relativized polynomial time hierarchy and relativizatio...
We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial...
AbstractIn a previous paper the present authors (Baier and Wagner, 1996) investigated an ∃-∀-hierarc...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
AbstractThe polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarc...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractIn a previous paper the present authors (Baier and Wagner, 1996) investigated an ∃-∀-hierarc...
The polynomialtime many-one and Turing reducibilities, Karp and Cook reducibilities respectively, p...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
AbstractBased on Valiant's class #P of all functions counting the number of accepting computations o...
AbstractVarious sets of Turing machines naturally occuring in the theory of computational complexity...
AbstractWe consider the relation between the relativized polynomial time hierarchy and relativizatio...
We show that every set in the ΘP2 level of the polynomial hierarchy -- that is, every set polynomial...
AbstractIn a previous paper the present authors (Baier and Wagner, 1996) investigated an ∃-∀-hierarc...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characteriz...
DOI
Add to ORKG