关于随机约简下的完备性

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

Suresh Chari, P. Rohatgi

{"title":"关于随机约简下的完备性","authors":"Suresh Chari, P. Rohatgi","doi":"10.1109/SCT.1993.336529","DOIUrl":null,"url":null,"abstract":"The authors study the notion of completeness under random reductions and explore how that depends on the type and success probability of the reduction. They obtain absolute separations between completeness notions under various random reductions and between random reductions and deterministic reductions. These separations are obtained in appropriately high complexity classes where these questions do not have contradictory relativizations. The results show that the notion of completeness under random reductions is sensitive to very small changes in success probability.<<ETX>>","PeriodicalId":331616,"journal":{"name":"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On completeness under random reductions\",\"authors\":\"Suresh Chari, P. Rohatgi\",\"doi\":\"10.1109/SCT.1993.336529\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors study the notion of completeness under random reductions and explore how that depends on the type and success probability of the reduction. They obtain absolute separations between completeness notions under various random reductions and between random reductions and deterministic reductions. These separations are obtained in appropriately high complexity classes where these questions do not have contradictory relativizations. The results show that the notion of completeness under random reductions is sensitive to very small changes in success probability.<<ETX>>\",\"PeriodicalId\":331616,\"journal\":{\"name\":\"[1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"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.336529\",\"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.336529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

作者研究了随机约简下完备性的概念，并探讨了它如何依赖于约简的类型和成功概率。他们得到了各种随机约简下完备性概念之间以及随机约简与确定性约简之间的绝对分离。这些分离是在适当的高复杂性类中获得的，这些问题没有相互矛盾的相对性。结果表明，随机约简下的完备性概念对成功概率的微小变化很敏感。

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

查看原文本刊更多论文

On completeness under random reductions

The authors study the notion of completeness under random reductions and explore how that depends on the type and success probability of the reduction. They obtain absolute separations between completeness notions under various random reductions and between random reductions and deterministic reductions. These separations are obtained in appropriately high complexity classes where these questions do not have contradictory relativizations. The results show that the notion of completeness under random reductions is sensitive to very small changes in success probability.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量