{"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}
引用次数: 4
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
