RP的0 - 1定律

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI:10.1109/CCC.2003.1214409

R. Impagliazzo, Philippe Moser

{"title":"RP的0 - 1定律","authors":"R. Impagliazzo, Philippe Moser","doi":"10.1109/CCC.2003.1214409","DOIUrl":null,"url":null,"abstract":"We show that if RP has p-measure nonzero then ZPP=EXP. As corollaries, we obtain a zero-one law for RP, and that both probabilistic classes ZPP and RP have the same p-measure. Finally we prove that if NP has p-measure nonzero then NP=AM.","PeriodicalId":286846,"journal":{"name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"A zero one law for RP\",\"authors\":\"R. Impagliazzo, Philippe Moser\",\"doi\":\"10.1109/CCC.2003.1214409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that if RP has p-measure nonzero then ZPP=EXP. As corollaries, we obtain a zero-one law for RP, and that both probabilistic classes ZPP and RP have the same p-measure. Finally we prove that if NP has p-measure nonzero then NP=AM.\",\"PeriodicalId\":286846,\"journal\":{\"name\":\"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2003.1214409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2003.1214409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

我们证明了如果RP具有p测度非零，则ZPP=EXP。作为推论，我们得到了RP的一个0 - 1定律，并且两个概率类ZPP和RP具有相同的p测度。最后证明了如果NP具有p测度非零，则NP=AM。

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

查看原文

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

本刊更多论文

A zero one law for RP

We show that if RP has p-measure nonzero then ZPP=EXP. As corollaries, we obtain a zero-one law for RP, and that both probabilistic classes ZPP and RP have the same p-measure. Finally we prove that if NP has p-measure nonzero then NP=AM.

求助全文

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

来源期刊

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.

自引率

0.00%

发文量

期刊最新文献

Inapproximability - some history and some open problems The complexity of stochastic sequences Quantum query complexity and semi-definite programming Lower bounds for predecessor searching in the cell probe model A strong inapproximability gap for a generalization of minimum bisection