Add to ORKGWe prove that the class NP has Co-NP-immune sets and the class Co-NP has NP-immune sets relative to a random oracle
AbstractA diagonalization method is discussed by which a recursive oracle A can be constructed such ...
Abstract: Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we in...
Let R be a notion of algorithmic randomness for individual subsets of N. We say B is a base for R ra...
In the present paper we prove that relative to random oracle A (with respect to the uniform measure)...
AbstractA new notion of an oracle machine being ‘helped’ by an oracle set is introduced. It is requi...
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
This paper shows limitations of the upward separation technique of Hartmanis, Immerman, and Sewelso...
The Random Oracle Hypothesis, attributed to Bennett and Gill, essentially states that the relationsh...
AbstractWe prove that if for some ϵ>0, NP contains a set that is DTIME(2nϵ)-bi-immune, then NP conta...
The existence of immune and simple sets in relativizations of the probabilistic polynomial time boun...
AbstractA set A is P-bi-immune if neither A nor its complement has an infinite subset in P. We inves...
AbstractThe problem of whether NP has a random hard set (that is, a hard set in RAND) is investigate...
An oracle is constructed relative to which there exists an NP set that has no infinite sparse subset...
Ko and Bruschi showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that ...
This paper shows limita.tions of the upward separation technique of Ha.rt-mania. Immerman, and Sewel...
AbstractA diagonalization method is discussed by which a recursive oracle A can be constructed such ...
Abstract: Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we in...
Let R be a notion of algorithmic randomness for individual subsets of N. We say B is a base for R ra...
In the present paper we prove that relative to random oracle A (with respect to the uniform measure)...
AbstractA new notion of an oracle machine being ‘helped’ by an oracle set is introduced. It is requi...
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
This paper shows limitations of the upward separation technique of Hartmanis, Immerman, and Sewelso...
The Random Oracle Hypothesis, attributed to Bennett and Gill, essentially states that the relationsh...
AbstractWe prove that if for some ϵ>0, NP contains a set that is DTIME(2nϵ)-bi-immune, then NP conta...
The existence of immune and simple sets in relativizations of the probabilistic polynomial time boun...
AbstractA set A is P-bi-immune if neither A nor its complement has an infinite subset in P. We inves...
AbstractThe problem of whether NP has a random hard set (that is, a hard set in RAND) is investigate...
An oracle is constructed relative to which there exists an NP set that has no infinite sparse subset...
Ko and Bruschi showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that ...
This paper shows limita.tions of the upward separation technique of Ha.rt-mania. Immerman, and Sewel...
AbstractA diagonalization method is discussed by which a recursive oracle A can be constructed such ...
Abstract: Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we in...
Let R be a notion of algorithmic randomness for individual subsets of N. We say B is a base for R ra...