PSPACE是由两个证明者在一轮中证明的

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

Jin-Yi Cai, A. Condon, R. Lipton

{"title":"PSPACE是由两个证明者在一轮中证明的","authors":"Jin-Yi Cai, A. Condon, R. Lipton","doi":"10.1109/SCT.1991.160250","DOIUrl":null,"url":null,"abstract":"It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"37 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"PSPACE is provable by two provers in one round\",\"authors\":\"Jin-Yi Cai, A. Condon, R. Lipton\",\"doi\":\"10.1109/SCT.1991.160250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved.<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"37 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"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.160250\",\"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.160250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 43

摘要

证明了PSPACE中的每一种语言，或无界轮交互证明系统所接受的每一种语言，都具有一个单轮、双证明者交互证明，其错误概率呈指数级小。为了得到这一结果，证明了一种简单而强大的方法的正确性，这种方法可以并行化两个证明者的交互证明，以减少他们的错误。

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

查看原文本刊更多论文

PSPACE is provable by two provers in one round

It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved.<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量