关于一轮证明系统中两个证明者的成功概率

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI:10.1109/SCT.1991.160251

U. Feige

{"title":"关于一轮证明系统中两个证明者的成功概率","authors":"U. Feige","doi":"10.1109/SCT.1991.160251","DOIUrl":null,"url":null,"abstract":"The author addresses the problem of reducing the error probability of two-prover one-round proof systems, without increasing the number of provers or the number of rounds. An example, the noninteractive agreement protocol, where executing such a protocol twice in parallel does not decrease the error probability at all is constructed. Upper bounds on the error probability of specific classes of protocols are proved. As a corollary, it is shown that every NEXPTIME language has a one-round two-prover proof system with constant error probability.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"92","resultStr":"{\"title\":\"On the success probability of the two provers in one-round proof systems\",\"authors\":\"U. Feige\",\"doi\":\"10.1109/SCT.1991.160251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The author addresses the problem of reducing the error probability of two-prover one-round proof systems, without increasing the number of provers or the number of rounds. An example, the noninteractive agreement protocol, where executing such a protocol twice in parallel does not decrease the error probability at all is constructed. Upper bounds on the error probability of specific classes of protocols are proved. As a corollary, it is shown that every NEXPTIME language has a one-round two-prover proof system with constant error probability.<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"92\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1991.160251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 92

摘要

作者解决了在不增加证明者数量或轮数的情况下，降低双证明者一轮证明系统的错误概率的问题。例如，构建了非交互式协议，其中并行执行两次这样的协议根本不会减少错误概率。证明了特定类型协议的错误概率上界。作为推论，证明了每一种NEXPTIME语言都有一个具有恒定错误概率的一轮双证明者证明系统

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

查看原文本刊更多论文

On the success probability of the two provers in one-round proof systems

The author addresses the problem of reducing the error probability of two-prover one-round proof systems, without increasing the number of provers or the number of rounds. An example, the noninteractive agreement protocol, where executing such a protocol twice in parallel does not decrease the error probability at all is constructed. Upper bounds on the error probability of specific classes of protocols are proved. As a corollary, it is shown that every NEXPTIME language has a one-round two-prover proof system with constant error probability.<>

求助全文

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

来源期刊

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量