Upward and downward separation results link the collapse of small and large classes, and are a standard tool in complexity theory. We study the limitations of upward and downward separation. We show that the exponential-time limited nondeterminism hierarchy does not robustly possess downward separation. We show that probabilistic classes do not robustly possess upward separation. Though NP is known [19] to robustly possess upward separation, we show that NP does not robustly possess upward separation with respect to strong (immunity) separation. On the other hand, we provide a structural sufficient condition for upward separation.
CITATION STYLE
Hemachandra, L. A., & Jha, S. K. (1993). Defying upward and downward separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 185–195). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_21
Mendeley helps you to discover research relevant for your work.