On the power of multi-prover interactive protocols-Reference-Cited by-同舟云学术

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

On the power of multi-prover interactive protocols

Published:1994-11 Issue:2 Volume:134 Page:545-557
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Fortnow Lance,Rompel John,Sipser Michael

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. Proof verification and hardness of approximation problems;Arora,1992

2. Probabilistic checking of proofs: A new characterization of NP;Arora,1992

3. Trading group theory for randomness;Babai,1985

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

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

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

1. Experimental implementation of an efficient test of quantumness;Physical Review A;2024-01-09

2. Structural Complexity of Rational Interactive Proofs;Lecture Notes in Computer Science;2023

3. Parallel repetition for all 3-player games over binary alphabet;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

4. Worlds to Die Harder For Open Oracle Questions for the 21st Century;ACM SIGACT News;2021-10-17

5. Model independent approach to probabilistic models;Theoretical Computer Science;2021-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP