两个证明游戏的平行重复(邀请调查)

2010 IEEE 25th Annual Conference on Computational Complexity Pub Date : 2010-06-09 DOI:10.1109/CCC.2010.9

R. Raz

{"title":"两个证明游戏的平行重复(邀请调查)","authors":"R. Raz","doi":"10.1109/CCC.2010.9","DOIUrl":null,"url":null,"abstract":"The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.","PeriodicalId":328781,"journal":{"name":"2010 IEEE 25th Annual Conference on Computational Complexity","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Parallel Repetition of Two Prover Games (Invited Survey)\",\"authors\":\"R. Raz\",\"doi\":\"10.1109/CCC.2010.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.\",\"PeriodicalId\":328781,\"journal\":{\"name\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2010.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 25th Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2010.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

平行重复定理指出，对于任何值小于1的双证明者博弈，平行重复以指数速率降低博弈的价值。本文简要介绍了双证明者对策的并行重复问题及其在理论计算机科学、数学和物理中的一些应用。我们将主要关注最近的结果。

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

查看原文本刊更多论文

Parallel Repetition of Two Prover Games (Invited Survey)

The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results.

求助全文

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

来源期刊

2010 IEEE 25th Annual Conference on Computational Complexity

自引率

0.00%

发文量