1- l完备集的多项式同构

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

Manindra Agrawal, Somenath Biswas

{"title":"1- l完备集的多项式同构","authors":"Manindra Agrawal, Somenath Biswas","doi":"10.1109/SCT.1993.336539","DOIUrl":null,"url":null,"abstract":"Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets for C under 1-L reductions are polynomial time isomorphic to one other. It is indicated how to generalize the result to reductions computed by finite-crossing machines.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Polynomial isomorphism of 1-L-complete sets\",\"authors\":\"Manindra Agrawal, Somenath Biswas\",\"doi\":\"10.1109/SCT.1993.336539\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets for C under 1-L reductions are polynomial time isomorphic to one other. It is indicated how to generalize the result to reductions computed by finite-crossing machines.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"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.336539\",\"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.336539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 12

摘要

设C为在登录约简下关闭的任何复杂度类。证明了C在1-L约简下的所有完备集是多项式时间同构的。给出了如何将结果推广到有限交叉机计算的约简。

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

查看原文本刊更多论文

Polynomial isomorphism of 1-L-complete sets

Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets for C under 1-L reductions are polynomial time isomorphic to one other. It is indicated how to generalize the result to reductions computed by finite-crossing machines.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量