AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructed such that the low and high hierarchies relative to A are infinite, and for each k an oracle Ak is constructed such that the low and high hierarchies relative to Ak have exactly k levels
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
This thesis is mainly concerned with the structural complexity of the Boolean Hi-erarchy. The Boolea...
AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructe...
We consider the uniform model of computation over any structure with two constants. For several stru...
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 ...
AbstractIn this paper we show that the techniques introduced by Furst (1984), which connected oracle...
In this paper we show that the techniques introduced by Furst (1984), which connected oracle separat...
Recently, boolean hierarchies over NP and over RP (denoted BH and RBH respectively) have been introd...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the p...
Abstract. Existing definitions of the relativizations of NC 1, L and NL do not preserve the inclusio...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
This thesis is mainly concerned with the structural complexity of the Boolean Hi-erarchy. The Boolea...
AbstractThe relativized low and high hierarchies within NP are considered. An oracle A is constructe...
We consider the uniform model of computation over any structure with two constants. For several stru...
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 ...
AbstractIn this paper we show that the techniques introduced by Furst (1984), which connected oracle...
In this paper we show that the techniques introduced by Furst (1984), which connected oracle separat...
Recently, boolean hierarchies over NP and over RP (denoted BH and RBH respectively) have been introd...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
We study three different hierarchies related to the notion of counting: the polynomial time counting...
Denote X the class of sets relative to which P = NP relativized and Z the class of sets relative to ...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the p...
Abstract. Existing definitions of the relativizations of NC 1, L and NL do not preserve the inclusio...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
This thesis is mainly concerned with the structural complexity of the Boolean Hierarchy. The Boolean...
This thesis is mainly concerned with the structural complexity of the Boolean Hi-erarchy. The Boolea...
DOI
Add to ORKG