Add to ORKGReducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relativized strength are presented and separated. The corresponding reduction classes of the sparse sets give two nonuniform analogs of the class N P ¿ coN P. An oracle-restricted positive relativization of the probabilistic class Z P P is developed
AbstractThis paper introduces a technique of relativizing already relativized computations and gives...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
Abstract. We study the computational complexity of an oracle set using a number of notions of random...
Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relat...
AbstractReducibility defined by oracle strong nondeterministic machines is studied. Two definitions ...
AbstractBuilding on the work of Adleman and Manders [1], we define a new class of reducibilities, th...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
AbstractWe consider several questions on the computational power of PP, the class of sets accepted b...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
AbstractWhether or not P is properly included in NP is currently one of the most important open prob...
AbstractA new notion of an oracle machine being ‘helped’ by an oracle set is introduced. It is requi...
AbstractThe principal result of this paper is a “positive relativization” of the open question “P = ...
This thesis investigates relations between complexity classes, resource bounded reducibilities and d...
An oracle X is constructed such that the exponential complexity class ΔEP,X2 equals the probabilisti...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
AbstractThis paper introduces a technique of relativizing already relativized computations and gives...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
Abstract. We study the computational complexity of an oracle set using a number of notions of random...
Reducibility defined by oracle strong nondeterministic machines is studied. Two definitions of relat...
AbstractReducibility defined by oracle strong nondeterministic machines is studied. Two definitions ...
AbstractBuilding on the work of Adleman and Manders [1], we define a new class of reducibilities, th...
AbstractVarious polynomial-time truth-table reducibilities are compared by their ability of using sp...
AbstractWe consider several questions on the computational power of PP, the class of sets accepted b...
For various polynomial-time reducibilities r , this paper asks whether being r-reducible to a spars...
AbstractWhether or not P is properly included in NP is currently one of the most important open prob...
AbstractA new notion of an oracle machine being ‘helped’ by an oracle set is introduced. It is requi...
AbstractThe principal result of this paper is a “positive relativization” of the open question “P = ...
This thesis investigates relations between complexity classes, resource bounded reducibilities and d...
An oracle X is constructed such that the exponential complexity class ΔEP,X2 equals the probabilisti...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
AbstractThis paper introduces a technique of relativizing already relativized computations and gives...
In this paper we study the consequences of the existence of sparse hard sets for different complexit...
Abstract. We study the computational complexity of an oracle set using a number of notions of random...