PSPACE is provable by two provers in one round-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

PSPACE is provable by two provers in one round

Published:1994-02 Issue:1 Volume:48 Page:183-193
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Cai Jin-yi,Condon Anne,Lipton Richard J.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference20 articles.

1. Trading group theory for randomness;Babai,1985

2. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes;Babai;J Comput. System Sci.,1988

3. Non-deterministic exponential time has two-prover interactive protocols;Babai;Comput. Complexity,1991

4. Hiding instances in mutioracle queries;Beaver,1990

5. Multi-prover interactive proofs: How to remove intractability;Ben-Or,1988

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Non-signaling proofs with o(√ log n) provers are in PSPACE;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06

2. Parallelization of entanglement-resistant multi-prover interactive proofs;Information Processing Letters;2014-10

3. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory;Journal of Computer and System Sciences;2011-01

4. Entangled Games Are Hard to Approximate;SIAM Journal on Computing;2011-01

5. The P=NP Question and Gödel’s Lost Letter;2010

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP