完备集的强约简与同构

IF 0.2 De Computis-Revista Espanola de Historia de la Contabilidad Pub Date : 2007-12-12 DOI:10.3233/COM-140028

Ryan C. Harkins, J. M. Hitchcock, A. Pavan

{"title":"完备集的强约简与同构","authors":"Ryan C. Harkins, J. M. Hitchcock, A. Pavan","doi":"10.3233/COM-140028","DOIUrl":null,"url":null,"abstract":"We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. -- If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. -- If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.","PeriodicalId":53933,"journal":{"name":"De Computis-Revista Espanola de Historia de la Contabilidad","volume":"21 1","pages":"168-178"},"PeriodicalIF":0.2000,"publicationDate":"2007-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Strong Reductions and Isomorphism of Complete Sets\",\"authors\":\"Ryan C. Harkins, J. M. Hitchcock, A. Pavan\",\"doi\":\"10.3233/COM-140028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. -- If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. -- If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.\",\"PeriodicalId\":53933,\"journal\":{\"name\":\"De Computis-Revista Espanola de Historia de la Contabilidad\",\"volume\":\"21 1\",\"pages\":\"168-178\"},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2007-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"De Computis-Revista Espanola de Historia de la Contabilidad\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/COM-140028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"De Computis-Revista Espanola de Historia de la Contabilidad","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/COM-140028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

研究了NP和PSPACE在强不确定性多项式时间约简(snp -约简)下的多项式时间完备集的结构。我们显示了以下结果。——如果NP包含p-随机语言，那么PSPACE的所有多项式时间完备集都是snp同构的。——如果NP∩co-NP包含p-random语言，那么NP的所有多项式时间完备集都是snp同构的。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Strong Reductions and Isomorphism of Complete Sets

We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. -- If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. -- If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.

求助全文

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

来源期刊

De Computis-Revista Espanola de Historia de la Contabilidad BUSINESS, FINANCE-

自引率

50.00%

发文量