走向平行重复猜想

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI:10.1109/SCT.1994.315794

O. Verbitsky

{"title":"走向平行重复猜想","authors":"O. Verbitsky","doi":"10.1109/SCT.1994.315794","DOIUrl":null,"url":null,"abstract":"We consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of Hales-Jewett's theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n/spl rarrspl infin/.<<ETX>>","PeriodicalId":386782,"journal":{"name":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"51","resultStr":"{\"title\":\"Towards the parallel repetition conjecture\",\"authors\":\"O. Verbitsky\",\"doi\":\"10.1109/SCT.1994.315794\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of Hales-Jewett's theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n/spl rarrspl infin/.<<ETX>>\",\"PeriodicalId\":386782,\"journal\":{\"name\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"51\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1994.315794\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1994.315794","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 51

摘要

我们考虑了并行重复n次的双证明者一轮交互协议的错误概率行为。指出了这一问题与拉姆齐理论中Hales-Jewett定理的密度形式的联系。这允许我们证明，当n/spl rarrspl infin/ >时，错误概率收敛到0。

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

查看原文本刊更多论文

Towards the parallel repetition conjecture

We consider the behavior of the error probability of a two-prover one-round interactive protocol repeated n times in parallel. We point out the connection of this problem with the density form of Hales-Jewett's theorem in Ramsey theory. This allows us to show that the error probability converges to 0 as n/spl rarrspl infin/.<>

求助全文

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

来源期刊

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

自引率

0.00%

发文量