指数时间和次指数时间集合

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI:10.1109/SCT.1991.160265

Shouwen Tang, B. Fu, Tian Liu

{"title":"指数时间和次指数时间集合","authors":"Shouwen Tang, B. Fu, Tian Liu","doi":"10.1109/SCT.1991.160265","DOIUrl":null,"url":null,"abstract":"The authors prove that the symmetric difference of a <or=/sup P//sub k-parity/-hard set for E and a subexponential time computable set is still <or=P/sub k-parity/-hard for E. This remains true for a <or=/sup P//sub m/-hard set for E since 1-parity reduction is many-one reduction. In addition, it is shown that it is not the case with respect to some other types of reductions. The authors introduce and study the notions of E-complete and E-hard kernels.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Exponential time and subexponential time sets\",\"authors\":\"Shouwen Tang, B. Fu, Tian Liu\",\"doi\":\"10.1109/SCT.1991.160265\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors prove that the symmetric difference of a <or=/sup P//sub k-parity/-hard set for E and a subexponential time computable set is still <or=P/sub k-parity/-hard for E. This remains true for a <or=/sup P//sub m/-hard set for E since 1-parity reduction is many-one reduction. In addition, it is shown that it is not the case with respect to some other types of reductions. The authors introduce and study the notions of E-complete and E-hard kernels.<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1991.160265\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}