Linked Data Explorer
On bounded round multi-prover interactive proof systems
Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error."
- "Abstract: "We compare bounded round multi-prover interactive proof systems (MIP's) with unbounded round interactive proof systems (IPS's). We show that for any constant [epsilon], any language accepted by an unbounded round IPS has a bounded round, 2-prover MIP that has error probability [epsilon], resolving an open problem of Fortnow, Rompel and Sipser [7]. To obtain this result, we show that a certain 1-round MIP that simulates the computation of an unbounded round IPS can be executed many times in parallel to significantly reduce its probability of error.""@en
- "On bounded round multi-prover interactive proof systems"@en