. We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input x belongs to the language L. It was previously suspected (and proved in a relativized sense) that coNP-complete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having two-prover interactive proof systems is nondeterministic exponential time. After the recent results that all languages in PSPACE have single prover interactive proofs (Lund, Fortnow, Karloff, Nisan, and Shamir), this represents a further step demonstrating the unexpectedly immense power of randomization and interaction in efficient provability. Indeed, it follows that multiple provers with coins are strictly stronger than without, since NEXP<F NaN> 6= NP . In particular, for the first time, provably p...
|
2010
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
350
|
The complexity of theorem proving procedures
– Cook
- 1971
|
|
263
|
Fast probabilistic algorithms for verification of polynomial identities
– Schwartz
- 1980
|
|
253
|
Designing programs that check their work
– Blum, Kannan
- 1995
|
|
234
|
Arthur–Merlin games: A randomized proof system, and a hierarchy of complexity classes
– Babai, Moran
- 1988
|
|
232
|
Trading group theory for randomness
– Babai
- 1985
|
|
228
|
Algebraic Methods for Interactive Proof Systems
– Lund, Fortnow, et al.
- 1992
|
|
202
|
Some connections between nonuniform and uniform complexity classes. STOC
– Karp, Lipton
- 1980
|
|
181
|
Checking computations in polylogarithmic time
– Babai, Fortnow, et al.
- 1991
|
|
144
|
Hiding instances in multioracle queries
– Beaver, Feigenbaum
- 1990
|
|
102
|
Multi-prover interactive proofs: How to remove intractability assumptions
– Ben-Or, Goldwasser, et al.
- 1988
|
|
102
|
On the power of multi-prover interactive protocols. Theoretical Computer Science
– Fortnow, Rompel, et al.
- 1994
|
|
87
|
New directions in testing
– Lipton
- 1991
|
|
75
|
The knowledge complexity of interactive proofs
– Goldwasser, Micali, et al.
- 1989
|
|
72
|
The complexity of perfect zero-knowledge
– Fortnow
- 1989
|
|
64
|
On the Markov chain simulation method for uniform combinatorial distributions and simulated
– Aldous
- 1987
|
|
64
|
On Some Central Problems In Computational Complexity
– Simon
- 1975
|
|
51
|
Sparse sets
– Hartmanis, Immerman, et al.
- 1985
|
|
44
|
Arithmetization: a new method in structural complexity theory
– Babai, Fortnow
- 1991
|
|
39
|
Separating nondeterministic time complexity classes
– Seiferas, Fischer, et al.
- 1978
|
|
38
|
The complexity of computing the permanent", Theoretical computer science
– Valiant
- 1979
|
|
32
|
Are there interactive protocols for co-NP languages
– Fortnow, Sipser
- 1988
|
|
30
|
On the computational power of PP and \PhiP
– Toda
- 1989
|
|
27
|
Universal'ny*ie pereborny*ie zadachi (Universal search problems
– Levin
- 1973
|
|
25
|
NP is as easy as detecting unique solutions. Theoretical Computer Science 47
– Valiant, Vazirani
- 1986
|
|
19
|
Self-testing and self-correcting programs, with applications to numerical programs
– Blum, Luby, et al.
- 1990
|
|
16
|
E-mail and the unexpected power of interaction
– Babai
- 1990
|
|
14
|
Linear Algebra Methods
– Babai, Frankl
- 1992
|
|
14
|
Complexity-Theoretic Aspects of Interactive Proof Systems
– FORTNOW
- 1989
|
|
10
|
The optimum prover lives
– Feldman
- 1986
|
|
10
|
Relativized arthur-merlin versus merlin-arthur games
– Santha
- 1989
|
|
7
|
Complexity Classes of Alternating Machines with Oracles
– Orponen
- 1983
|
|
3
|
On Relativized Exponential and
– Heller
- 1986
|
|
2
|
Trakhtenbrot, A survey of Russian approaches to Perebor (brute-force search) algorithms, Annals of the History of Computing 6
– A
- 1984
|
|
1
|
Erd os, Representation of group elements as short products
– Babai, P
- 1982
|
|
1
|
PSPACE is provable by two provers in one round, manuscript
– Cai
- 1990
|
|
1
|
On the complexity of clique approximation, in preparation
– Feige, Goldwasser, et al.
|
|
1
|
Games against Nature, Proc. 24th Ann
– Papadimitriou
- 1983
|
|
1
|
Multiple-person alternation, Proc. 20th Ann
– Peterson, Reif
- 1979
|
|
1
|
Efficient MIP protocol and a stronger condition on clique approximation, in preparation
– Szegedy
|
|
