SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 134, Issue 2, 1994, Pages 545-557

On the power of multi-prover interactive protocols

(3) Fortnow, Lance a Rompel, John a Sipser, Michael a

a MASSACHUSETTS INSTITUTE OF TECHNOLOGY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS;

INTERACTIVE PROOF SYSTEM MODEL; INTERACTIVE PROOF SYSTEMS; MULTIPROVER INTERACTIVE PROTOCOLS; RELATIVIZED WORLD;

COMPUTATIONAL COMPLEXITY;

EID: 0028544648 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(94)90251-8 Document Type: Article

Times cited : (94)

References (29)

1
- 85028925878
- Proof verification and hardness of approximation problems
- IEEE, New York
- (1992) Proc. 33rd IEEE Symposium on Foundations of Computer Science , pp. 14-23
- Arora¹ Lund² Motwani³ Sudan⁴ Szegedy⁵

2
- 84968014854
- Probabilistic checking of proofs: A new characterization of NP
- IEEE, New York
- (1992) Proc. 33rd IEEE Symposium on Foundations of Computer Science , pp. 2-13
- Arora¹ Safra²

3
- 0021980820
- Trading group theory for randomness
- ACM, New York
- (1985) Proc. 17th ACM Symposium on the Theory of Computing , pp. 421-429
- Babai¹

4
- 0002771903
- Non-deterministic exponential time has two-prover interactive protocols
- (1991) Computational Complexity , vol.1 , Issue.1 , pp. 3-40
- Babai¹ Fortnow² Lund³

5
- 0023995534
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- (1988) J. Comput. System Sci. , vol.36 , Issue.2 , pp. 254-276
- Babai¹ Moran²

6
- 84898945449
- Multi-prover interactive proofs: How to remove intractability assumptions
- ACM, New York
- (1988) Proc. 20th ACM Symposium on the Theory of Computing , pp. 113-131
- Ben-Or¹ Goldwasser² Kilian³ Wigderson⁴

7
- 0024867752
- Designing programs that check their work
- ACM, New York
- (1989) Proc. 21st ACM Symposium on the Theory of Computing , pp. 86-97
- Blum¹ Kannan²

8
- 0025022876
- Self-testing and self-correcting programs, with applications to numerical programs
- ACM, New York
- (1990) Proc. 22nd ACM Symposium on the Theory of Computing , pp. 73-83
- Blum¹ Luby² Rubinfeld³

9
- 0023646410
- Does co-NP have short interactive proofs?
- (1987) Inform. Process. Lett. , vol.25 , Issue.2 , pp. 127-132
- Boppana¹ Håstad² Zachos³

10
- 0025686844
- On bounded round multi-prover interactive proof systems
- IEEE, New York
- (1990) Proc. 5th IEEE Structure in Complexity Theory Conference , pp. 45-54
- Cai¹ Condon² Lipton³

11
- 0026373973
- PSAPCE is provable by two provers in one round
- IEEE, New York
- (1991) Proc. 6th IEEE Structure in Complexity Theory Conference , pp. 110-115
- Cai¹ Condon² Lipton³

12
- 0026908730
- On games of incomplete information
- (1992) Theoret. Comput. Sci. , vol.103 , Issue.1 , pp. 25-38
- Cai¹ Condon² Lipton³

13
- 0026393591
- On the success probability of the two provers in one round proof systems
- IEEE, New York
- (1991) Proc. 6th IEEE Structure in Complexity Theory Conference , pp. 116-123
- Feige¹

14
- 0026385082
- Approximating clique is almost NP-complete
- IEEE, New York
- (1991) Proc. 32nd IEEE Symposium on Foundations of Computer Science , pp. 2-12
- Feige¹ Goldwasser² Lovász³ Safra⁴ Szegedy⁵

15
- 0026991175
- Two-prover one-round proof systems: Their power and their problems
- ACM, New York
- (1992) Proc. 24th ACM Symposium on the Theory of Computing , pp. 733-744
- Feige¹ Lovász²

16
- 84894281582
- From scratch to byzantine agreement in constant expected time
- ACM, New York
- (1988) Proc. 20th ACM Symposium on the Theory of Computing , pp. 148-161
- Feldman¹ Micali²

17
- 0003210004
- The complexity of perfect zero-knowledge
- S. Micali, Advances in Computing Research, JAI Press, Greenwich
- (1989) Randomness and Computation , vol.5 , pp. 327-343
- Fortnow¹

18
- 0038435616
- Complexity-theoretic aspects of interactive proof systems
- Tech Report MIT/LCS/TR-447, Massachusetts Institute of Technology
- (1989) Ph.D. thesis
- Fortnow¹

19
- 0023728126
- On the power of multi-prover interactive protocols
- IEEE, New York
- (1988) Proc. 3rd IEEE Structure in Complexity Theory Conference , pp. 156-161
- Fortnow¹ Rompel² Sipser³

20
- 0024057387
- Are there interactive protocols for co-NP languages?
- (1988) Inform. Process. Lett. , vol.28 , pp. 249-251
- Fortnow¹ Sipser²

21
- 0003351499
- On completeness and soundness in interactive proof systems
- S. Micali, Advances in Computing Research, JAI Press, Greenwich
- (1989) Randomness and Computation , vol.5 , pp. 429-442
- Furer¹ Goldreich² Mansour³ Sipser⁴ Zachos⁵

22
- 71149116146
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- (1991) J. ACM , vol.38 , Issue.3 , pp. 691-729
- Goldreich¹ Micali² Wigderson³

23
- 0024611659
- The knowledge complexity of interactive proof-systems
- (1989) SIAM J. Comput. , vol.18 , Issue.1 , pp. 186-208
- Goldwasser¹ Micali² Rackoff³

24
- 0001796243
- Private coins versus public coins in interactive proof systems
- S. Micali, Advances in Computing Research, JAI Press, Greenwich
- (1989) Randomness and Computation , vol.5 , pp. 73-90
- Goldwasser¹ Sipser²

25
- 0003931157
- Uses of Randomness in Algorithms and Protocols
- MIT Press, Cambridge, MA
- (1990) ACM Distinguised Dissertation
- Kilian¹

26
- 0026400402
- Fully parallelized multi prover protocols for NEXP-time
- IEEE, New York
- (1991) Proc. 32nd IEEE Symposium on Foundations of Computer Science , pp. 13-18
- Lapidot¹ Shamir²

27
- 0026930922
- Algebraic methods for interactive proof systems
- (1992) J. ACM , vol.39 , Issue.4 , pp. 859-868
- Lund¹ Fortnow² Karloff³ Nisan⁴

28
- 0026366408
- Optimization, approximation, and complexity classes
- (1991) J. Comput. System Sci. , vol.43 , pp. 425-440
- Papadimitriou¹ Yannakakis²

29
- 0026930543
- IP = PSPACE
- (1992) J. ACM , vol.39 , Issue.4 , pp. 869-877
- Shamir¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.