对于拟线性查询，EXP不是多项式时间图灵可约到稀疏集的

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference Pub Date : 1993-05-18 DOI:10.1109/SCT.1993.336528

B. Fu

{"title":"对于拟线性查询，EXP不是多项式时间图灵可约到稀疏集的","authors":"B. Fu","doi":"10.1109/SCT.1993.336528","DOIUrl":null,"url":null,"abstract":"The lower bounds of queries required by the polynomial-time Turing reductions from exponential time classes to the sets of small density are investigated. Results for complexity classes E=DTIME(2/sup linear/) and EXP-DTIME(2/sup poly/) are shown.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets\",\"authors\":\"B. Fu\",\"doi\":\"10.1109/SCT.1993.336528\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The lower bounds of queries required by the polynomial-time Turing reductions from exponential time classes to the sets of small density are investigated. Results for complexity classes E=DTIME(2/sup linear/) and EXP-DTIME(2/sup poly/) are shown.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1993.336528\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1993.336528","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

研究了从指数时间类到小密度集的多项式时间图灵约简所需查询的下界。给出了复杂度类E=DTIME(2/sup linear/)和EXP-DTIME(2/sup poly/)的结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets

The lower bounds of queries required by the polynomial-time Turing reductions from exponential time classes to the sets of small density are investigated. Results for complexity classes E=DTIME(2/sup linear/) and EXP-DTIME(2/sup poly/) are shown.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量