AbstractA diagonalization method is discussed by which a recursive oracle A can be constructed such that NP(A) has a set L(A) which is both simple and P(A)-immune
AbstractWe consider the uniform model of computation over arbitrary structures with two constants. F...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
This work analysis the so-called "Relativization Barrier" with respect to Baker-Gill-Solovay oracle ...
Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle ...
AbstractA formal notion of diagonalization is developed which allows to enforce properties that are ...
Abstract: Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we in...
AbstractRevisiting the 30-years-old notions of resource-bounded immunity and simplicity, we investig...
We prove that the class NP has Co-NP-immune sets and the class Co-NP has NP-immune sets relative to ...
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
We consider the uniform model of computation over any structure with two constants. For several stru...
Ko and Bruschi showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that ...
By means of the definition of predicative recursion, we introduce a programming language that provid...
The existence of immune and simple sets in relativizations of the probabilistic polynomial time boun...
In this paper we show that the techniques introduced by Furst (1984), which connected oracle separat...
AbstractIn this paper we show that the techniques introduced by Furst (1984), which connected oracle...
AbstractWe consider the uniform model of computation over arbitrary structures with two constants. F...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
This work analysis the so-called "Relativization Barrier" with respect to Baker-Gill-Solovay oracle ...
Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle ...
AbstractA formal notion of diagonalization is developed which allows to enforce properties that are ...
Abstract: Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we in...
AbstractRevisiting the 30-years-old notions of resource-bounded immunity and simplicity, we investig...
We prove that the class NP has Co-NP-immune sets and the class Co-NP has NP-immune sets relative to ...
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
We consider the uniform model of computation over any structure with two constants. For several stru...
Ko and Bruschi showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that ...
By means of the definition of predicative recursion, we introduce a programming language that provid...
The existence of immune and simple sets in relativizations of the probabilistic polynomial time boun...
In this paper we show that the techniques introduced by Furst (1984), which connected oracle separat...
AbstractIn this paper we show that the techniques introduced by Furst (1984), which connected oracle...
AbstractWe consider the uniform model of computation over arbitrary structures with two constants. F...
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time no...
This work analysis the so-called "Relativization Barrier" with respect to Baker-Gill-Solovay oracle ...
DOI
Add to ORKG