Lance Fortnow, John Rompel, Michael Sipser  Home/Search
Context Related
| uchicago.edu/~fortnow/papers/....mip.ps uchicago.edu/~fortnow/papers/....mip.ps nec.com/homepages/fortnow/pape...mip.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uchicago.edu/~fortnow/papers/ (more) From: uchicago.edu/~fortnow/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we consider a further generalization of the proof system model, due to Ben-Or, Goldwasser, Kilian and Wigderson [6], where instead of a single prover there may be many. This apparently gives the model additional power. The intuition for this may be seen by considering the case of two criminal suspects who are under interrogation to see if they are guilty of together robbing a bank. Of course they (the provers) are trying to convince Scotland Yard (the verifier) of their innocence.... (Update)
Cited by: More
Consequences and Limits of Nonlocal Strategies - Richard Cleve Peter (Correct)
Free Bits, PCPs and Non-Approximability--- - Towards Tight Results (Correct)
Free Bits, PCPs and Non-Approximability - Towards Tight.. - Bellare, Goldreich.. (1995) (Correct)
Similar documents (at the sentence level):
26.0%: Complexity-Theoretic Aspects of Interactive Proof Systems - Fortnow (1989) (Correct)
5.4%: Non-Deterministic Exponential Time Has Two-Prover.. - Babai, Fortnow, Lund (1991) (Correct)
Active bibliography (related documents): More All
0.8: A Short History of Computational Complexity - Fortnow, Homer (2002) (Correct)
0.4: The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994) (Correct)
0.3: A Parallel Repetition Theorem - Raz (1995) (Correct)
Similar documents based on text: More All
0.3: On the Role of Algebra in the Efficient Verification of Proofs - Sudan (1994) (Correct)
0.3: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
0.3: Interactive Proof Systems And Alternating Time-Space Complexity - Lance Fortnow (1991) (Correct)
Related documents from co-citation: More All
80: Non-deterministic exponential time has twoprover interactive protocols - Babai, Fortnow et al. - 1991
56: Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
45: Multi-Prover Interactive Proofs: How to Remove Intractability (context) - Ben-Or, Goldwasser et al. - 1988
BibTeX entry: (Update)
L. Fortnow, J. Rompel, and M. Sipser. On the power of multi-prover interactive protocols. In Proc. of the 3rd Conference on Structure in Complexity Theory, pages 156--161, 1988. http://citeseer.ist.psu.edu/fortnow88power.html More
@article{ fortnow94power,
author = "Lance Fortnow and John Rompel and Michael Sipser",
title = "On the power of multi-prover interactive protocols",
journal = "Theoretical Computer Science",
volume = "134",
number = "2",
pages = "545--557",
year = "1994",
url = "citeseer.ist.psu.edu/fortnow88power.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1989
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
212 Probabilistic checking of proofs: A new characterization of .. - Arora, Safra - 1992
203 Approximating clique is almost NP-complete (context) - Feige, Goldwasser et al. - 1991
194 Proofs that yield nothing but their validity or all language.. (context) - Goldreich, Micali et al. - 1991
192 Designing programs that check their work - Blum, Kannan - 1989
173 Trading group theory for randomness (context) - Babai - 1985
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
98 Private coins versus public coins in interactive proof syste.. (context) - Goldwasser, Sipser - 1989
93 the power of multi-prover interactive protocols - Fortnow, Rompel et al. - 1988
87 Arthur-Merlin games: a randomized proof system (context) - Babai, Moran - 1988
83 Multi-prover interactive proofs: How to remove intractabilit.. (context) - Ben-Or, Goldwasser et al. - 1988
73 Does co-NP have short interactive proofs (context) - Boppana, Hastad et al. - 1987
70 The complexity of perfect zero-knowledge - Fortnow - 1989
69 Two-prover one-round proof systems: Their power and their pr.. (context) - Feige, Lov'asz - 1992
65 Journal of the ACM (context) - Shamir, PSPACE - 1992
49 Fully parallelized multi prover protocols for NEXP-time (context) - Lapidot, Shamir - 1991
39 On completeness and soundness in interactive proof systems - Furer, Goldreich et al. - 1989
18 Are there interactive protocols for co-NP languages - Fortnow, Sipser - 1988
17 PSPACE is provable by two provers in one round - Cai, Condon et al. - 1991
14 the success probability of the two provers in one round proo.. (context) - Feige - 1991
14 Complexity-theoretic aspects of interactive proof systems - Fortnow - 1989
10 On bounded round multi-prover interactive proof systems (context) - Cai, Condon et al. - 1990
8 Self-testing and self-correcting programs (context) - Blum, Luby et al. - 1990
2 Theoretical Computer Science (context) - Cai, Condon et al. - 1992
1 ACM Distinguised Dissertation (context) - Kilian, Randomness et al. - 1990
1 From scratch to byzantine agreement in constant expected tim.. (context) - Feldman, Micali - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uchicago.edu/~fortnow/papers/): More
Beyond P^NP = NEXP - Fenner, Fortnow (Correct)
Arithmetization: A New Method In Structural Complexity Theory - Babai, Fortnow (1991) (Correct)
BPP has Subexponential Time Simulations unless.. - Babai, Fortnow.. (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC