We are interested in separating classes in the exponential-time hierarchy, EXPH, from classes in the polynomial-time hierarchy, PH. In this paper we show that, for any fixed integer c, the class of sets accepted in deterministic polynomial time using at most O(n(c)) queries to an NP oracle, p(NP[O(nc)]), is a proper subset of NEXP. This improves a previous result by Fu et al. [7]. Further, we generalize this separation to related levels of PH and EXPH showing that, for any fixed integer c and i greater than or equal to 1, Delta(i)P([O(nc)]) subset of or equal to Sigma(i-1)(EXP) This improves the long standing separations which result from the relativization of the time hierarchy theorem [9, 6, 17, 3, 1]. [References: 19]
展开▼
