Results 1 
2 of
2
Limitations of the Upward Separation Technique
, 1990
"... this paper was presented at the 16th International Colloquium on Automata, Languages, and Programming [3] ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
this paper was presented at the 16th International Colloquium on Automata, Languages, and Programming [3]
Strong SelfReducibility Precludes Strong Immunity
, 1995
"... Do selfreducible sets inherently lack immunity from deterministic polynomial time? Though this is unlikely to be true in general, in this paper we prove that sufficiently strong selfreducibility precludes sufficiently strong immunity from deterministic polynomial time. In particular, we prove that ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Do selfreducible sets inherently lack immunity from deterministic polynomial time? Though this is unlikely to be true in general, in this paper we prove that sufficiently strong selfreducibility precludes sufficiently strong immunity from deterministic polynomial time. In particular, we prove that NT is not P balanced immune. However, we prove that NT, a class whose sets have very strong selfreducibility properties, is P biimmune relative to a generic oracle. Thus, the previous result cannot be relativizably extended to biimmunity. We also prove that NP and \PhiP are both P balanced immune relative to a random oracle; the former provides the strongest known relativized separation of NP from P. 1 Introduction Relativization results have a long but increasingly checkered history. Today, there are conflicting views as to the extent to which relativization results give insight into the structure of feasible computation [HCRR90,All90,HCC + 92,For94], even as oracle construction has ...