{"title":"使用有界查询类将指数时间层次结构中的类与PH中的类分开","authors":"Sarah Mocas","doi":"10.1109/SCT.1994.315818","DOIUrl":null,"url":null,"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, P/sup NP[O(n(c/)])/spl sube/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/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.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH\",\"authors\":\"Sarah Mocas\",\"doi\":\"10.1109/SCT.1994.315818\",\"DOIUrl\":null,\"url\":null,\"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, P/sup NP[O(n(c/)])/spl sube/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/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.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using bounded query classes to separate classes in the exponential time hierarchy from classes in PH
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, P/sup NP[O(n(c/)])/spl sube/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/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.<>