AbstractNo P-immune set having exponential gaps is positive-Turing self-reducible
AbstractAn oracle A is k-cheatable if there is a polynomial-time algorithm to determine the answers ...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
We study whether sets inside NP can be reduced to sets with low information content but possibly sti...
AbstractNo P-immune set having exponential gaps is positive-Turing self-reducible
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
AbstractWe show that any p-selective and self-reducible set is in P. As the converse is also true, w...
AbstractSelf-reducible sets and some low sets, including p-selective sets, and weakly p-selective se...
AbstractWe distinguish self-reducibility of a languageLwith the question of whether search reduces t...
AbstractWe prove that if for some ϵ>0, NP contains a set that is DTIME(2nϵ)-bi-immune, then NP conta...
Abstract This paper investigates the relation between immunity and hardness in exponential time. The...
Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. In this paper...
AbstractRevisiting the 30-years-old notions of resource-bounded immunity and simplicity, we investig...
AbstractMuch structural work on NP-complete sets has exploited SAT′s d-self-reducibility. In this pa...
AbstractA set A is P-bi-immune if neither A nor its complement has an infinite subset in P. We inves...
AbstractNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and...
AbstractAn oracle A is k-cheatable if there is a polynomial-time algorithm to determine the answers ...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
We study whether sets inside NP can be reduced to sets with low information content but possibly sti...
AbstractNo P-immune set having exponential gaps is positive-Turing self-reducible
Do self-reducible sets inherently lack immunity from deterministic polynomial time? Though this is u...
AbstractWe show that any p-selective and self-reducible set is in P. As the converse is also true, w...
AbstractSelf-reducible sets and some low sets, including p-selective sets, and weakly p-selective se...
AbstractWe distinguish self-reducibility of a languageLwith the question of whether search reduces t...
AbstractWe prove that if for some ϵ>0, NP contains a set that is DTIME(2nϵ)-bi-immune, then NP conta...
Abstract This paper investigates the relation between immunity and hardness in exponential time. The...
Much structural work on NP-complete sets has exploited SAT's d-self-reducibility. In this paper...
AbstractRevisiting the 30-years-old notions of resource-bounded immunity and simplicity, we investig...
AbstractMuch structural work on NP-complete sets has exploited SAT′s d-self-reducibility. In this pa...
AbstractA set A is P-bi-immune if neither A nor its complement has an infinite subset in P. We inves...
AbstractNew self-reducibility structures are proposed to deal with sets outside the class PSPACE and...
AbstractAn oracle A is k-cheatable if there is a polynomial-time algorithm to determine the answers ...
AbstractIn this paper we study the effect that the self-reducibility properties of a set have on its...
We study whether sets inside NP can be reduced to sets with low information content but possibly sti...
DOI
Add to ORKG