Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH.  show that for any fixed integer c, P/sup NP[O(n(c/)])/spl sube/NEXP. This improves a previous result by B. Fu, H. Li and Y. Zhong (1992). Further,  generalize this separation to related levels of PH and EXPH, showing that for any fixed integer c and i/spl ges/1, /spl Deltasub isup P[O(n(c/)])/spl subespl Sigmasub i-1sup 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. >
['Sarah Mocas']
I am writing a research paper on a idea Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
[{"from": "human", "value": "I am writing a research paper on a idea Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy, PH.  show that for any fixed integer c, P/sup NP[O(n(c/)])/spl sube/NEXP. This improves a previous result by B. Fu, H. Li and Y. Zhong (1992). Further,  generalize this separation to related levels of PH and EXPH, showing that for any fixed integer c and i/spl ges/1, /spl Deltasub isup P[O(n(c/)])/spl subespl Sigmasub i-1sup 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. >"}]