Abstract"Downward separation" results show that when small classes collapse, larger ones also collapse. For example, Stockmeyer proved that if P=NP, then the polynomial hierarchy collapses to P, and this result itself holds in every relativized world. In contrast, we construct a relativized world in which the exponential-time limited nondeterminism hierarchy does not display such behavior: its tower levels collapse yet its upper levels separate. "Upward separation" results typically show that polynomial-time classes differ on sparse or tally sets if and only if their exponential analogs differ. For example, Hartmanis, Immerman, and Sewelson proved that NP-P contains sparse sets if and only if E ≠ NE, and this result itself holds in every re...
AbstractWe obtain some results of the form: If certain complexity classes satisfy a non-uniform cond...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the p...
This paper studies the range of application of the upward separation technique that has been introdu...
Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classe...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
This paper shows limitations of the upward separation technique of Hartmanis, Immerman, and Sewelso...
This paper shows limita.tions of the upward separation technique of Ha.rt-mania. Immerman, and Sewel...
We extend previous collapsing results involving the exponential hierarchy by using recent hardness-r...
AbstractIn this paper a new upward separation technique is developed. It is applied to prove that fo...
This paper investigates the complexity of the high levels of the exponential hierarchy [HY84,HIS85]...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
During the past decade, nine papers have obtained increasingly strong consequences from the assumpti...
AbstractWe are interested in separating classes in the exponential-time hierarchy, EXPH, from classe...
AbstractWe obtain some results of the form: If certain complexity classes satisfy a non-uniform cond...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the p...
This paper studies the range of application of the upward separation technique that has been introdu...
Downward collapse (a.k.a. upward separation) refers to cases where the equality of two larger classe...
This paper investigates the structural properties of sets in NP-P and shows that the computational d...
This paper shows limitations of the upward separation technique of Hartmanis, Immerman, and Sewelso...
This paper shows limita.tions of the upward separation technique of Ha.rt-mania. Immerman, and Sewel...
We extend previous collapsing results involving the exponential hierarchy by using recent hardness-r...
AbstractIn this paper a new upward separation technique is developed. It is applied to prove that fo...
This paper investigates the complexity of the high levels of the exponential hierarchy [HY84,HIS85]...
We develop the notions of “generalized lowness” for sets in PH (the union of the polynomial-time hie...
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilis...
During the past decade, nine papers have obtained increasingly strong consequences from the assumpti...
AbstractWe are interested in separating classes in the exponential-time hierarchy, EXPH, from classe...
AbstractWe obtain some results of the form: If certain complexity classes satisfy a non-uniform cond...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the...
Chang and Kadin have shown that if the difference hierarchy over NP collapses to level k, then the p...