AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hierarchies below the degree of the halting problem. For this purpose a complexity theoretic counterpart of the jump operator in recursion theory is defined. Some elementary properties of these hierarchies are investigated. The high hierarchy is, in some sense, a hierarchy of generalized NP-completeness notions
AbstractHierarchies considered in computability theory and in complexity theory are related to some ...
Theories of complexity have generally not addressed hierarchical complexity. However, within develop...
Kintala and Fischer [7] defined the limited nondeterminism hierarchy within NP, the so called b ...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call ...
This thesis is mainly concerned with the structural complexity of the Boolean Hi-erarchy. The Boolea...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
Abstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for c...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
For recursive sets A, define a polynomial time analogue of the ordinary recursion theoretic jump by ...
AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructe...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
We investigate an imperative and a functional programming language. The computational power of fragm...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
AbstractHierarchies considered in computability theory and in complexity theory are related to some ...
Theories of complexity have generally not addressed hierarchical complexity. However, within develop...
Kintala and Fischer [7] defined the limited nondeterminism hierarchy within NP, the so called b ...
AbstractA low and a high hierarchy within NP are defined. The definition is similar to the jump hier...
The polynomial-time hierarchy (PH) is central for many considerations of complexity theory. We call ...
This thesis is mainly concerned with the structural complexity of the Boolean Hi-erarchy. The Boolea...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
Abstract. We introduce a hierarchy of fast-growing complexity classes and show its suitability for c...
For recursive sets A, define a complexity theoretic version of the ordinary recursion theoretic jump...
For recursive sets A, define a polynomial time analogue of the ordinary recursion theoretic jump by ...
AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructe...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
International audienceWe introduce a hierarchy of fast-growing complexity classes and show its suita...
We investigate an imperative and a functional programming language. The computational power of fragm...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
AbstractHierarchies considered in computability theory and in complexity theory are related to some ...
Theories of complexity have generally not addressed hierarchical complexity. However, within develop...
Kintala and Fischer [7] defined the limited nondeterminism hierarchy within NP, the so called b ...
DOI
Add to ORKG