DocumentCode :
1992754
Title :
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
Author :
Mocas, Sarah E.
Author_Institution :
Dept. of Comput. Sci., Portland State Univ., OR, USA
fYear :
1994
fDate :
28 Jun- 1 Jul 1994
Firstpage :
53
Lastpage :
58
Abstract :
We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH. We show that for any fixed integer c, PNP[O(n(c)])⊆NEXP. This improves a previous result by B. Fu, H. Li and Y. Zhong (1992). Further, we generalize this separation to related levels of PH and EXPH, showing that for any fixed integer c and i⩾1, ΔiP[O(n(c/)])⊆Σsub i-1/EXP . This improves the long standing separations which result from the relativization of the time hierarchy theorem. Related results for function classes are also considered
Keywords :
computational complexity; query processing; set theory; EXPH; PH; bounded query classes; exponential time hierarchy; fixed integer; function classes; polynomial time hierarchy; relativization; time hierarchy theorem; Complexity theory; Computer science; Mirrors; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-5670-0
Type :
conf
DOI :
10.1109/SCT.1994.315818
Filename :
315818
Link To Document :
بازگشت