随机实例上NP完全问题的同构

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

J. Belanger, Jie Wang

{"title":"随机实例上NP完全问题的同构","authors":"J. Belanger, Jie Wang","doi":"10.1109/SCT.1993.336540","DOIUrl":null,"url":null,"abstract":"Polynomial isomorphisms are defined for NP-complete sets on random instances. Not only are polynomial-time computable and invertible bijections among complete sets considered, but also it is required that these bijections preserve distributions on random instances of these sets. Sufficient conditions for randomized decision problems to be polynomially isomorphic are shown. It is then proved that all the known average-case NP-complete problems under many-one reductions are polynomially isomorphic. These problems include the randomized tiling problem, the randomized halting problem, the randomized Post correspondence problem, and the randomized word problem for Thue systems.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"331 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Isomorphisms of NP complete problems on random instances\",\"authors\":\"J. Belanger, Jie Wang\",\"doi\":\"10.1109/SCT.1993.336540\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Polynomial isomorphisms are defined for NP-complete sets on random instances. Not only are polynomial-time computable and invertible bijections among complete sets considered, but also it is required that these bijections preserve distributions on random instances of these sets. Sufficient conditions for randomized decision problems to be polynomially isomorphic are shown. It is then proved that all the known average-case NP-complete problems under many-one reductions are polynomially isomorphic. These problems include the randomized tiling problem, the randomized halting problem, the randomized Post correspondence problem, and the randomized word problem for Thue systems.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"331 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"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.336540\",\"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.336540","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

定义了随机实例上np完全集的多项式同构。本文不仅考虑了完全集合中多项式时间可计算的可逆双射，而且要求这些双射在这些集合的随机实例上保持分布。给出了随机决策问题多项式同构的充分条件。然后证明了所有已知的多约化下的平均情况np完全问题都是多项式同构的。这些问题包括随机平铺问题、随机停止问题、随机Post通信问题和随机单词问题

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

查看原文本刊更多论文

Isomorphisms of NP complete problems on random instances

Polynomial isomorphisms are defined for NP-complete sets on random instances. Not only are polynomial-time computable and invertible bijections among complete sets considered, but also it is required that these bijections preserve distributions on random instances of these sets. Sufficient conditions for randomized decision problems to be polynomially isomorphic are shown. It is then proved that all the known average-case NP-complete problems under many-one reductions are polynomially isomorphic. These problems include the randomized tiling problem, the randomized halting problem, the randomized Post correspondence problem, and the randomized word problem for Thue systems.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量