J. Cai, A. Condon, and R. Lipton. On bounded round multiprover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45--54, 1990. 13  Home/Search   Document Not in Database   Summary   Related Articles   Check

....some approximation problems. Arora [Aro98] after failing to achieve lower bounds for traveling salesman in the plane, has developed a polynomial time approximation algorithm for this and related problems. A series of results due to Cai, Condon, Lipton, Lapidot, Shamir, Feige and Lov asz [CCL92, CCL90, CCL91, Fei91, LS91, FL92] have modi ed the protocol of Babai, Fortnow and Lund [BFL91] 10 to show that every language in NEXP has a two prover, one round proof systems with an exponentially small error. This problem remained so elusive because running these proof systems in parallel does not ....

J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the 5th IEEE Structure in Complexity Theory Conference, pages 45-54. IEEE, New York, 1990.

....it is possible to give bounds that are independent of question and answer size. One such example (claimed without proof in [16] is that of unique free games, for which (G n ) G) n=4 . A proof of this appears in Appendix D. Feige and Kilian [14] extending a line of research studied in [9, 20, 12]) considered a class of games that are called confuse or compare games. In these games, with probability 1=2, the verifier plays a compare game (in which the number of segments involved is a constant) and with probability 1=2, the verifier plays a free game. They show that for confuse or ....

J. Cai, A. Condon, R. Lipton, "On Bounded Round Multi-Prover Interactive Proof Systems", Proc. of 5th IEEE Symposium on Structure in Complexity Theory, 45--54, 1990.

....the result of Lund, Fortnow, Karloff and Nisan and Theorem 3.1, Babai, Fortnow and Lund [4] have shown that every language accepted in nondeterministic exponential time has a two prover interactive proof system. A series of results due to Cai, Condon, Lipton, Lapidot, Shamir, Feige and Lov asz [12, 10, 11, 13, 26, 15] have modified the protocol of Babai, Fortnow and Lund [4] to show that every language in NEXP has a two prover, one round proof systems with an exponentially small error, strengthening the (unproven) claims made in an earlier version of this paper [19] The general question of parallelizing ....

....among themselves through the protocol then parallel runs of the protocol work independently like parallel runs of one prover interactive protocols [5] Unfortunately, this assumption is fallacious. As mentioned in section 2, results of Cai, Condon, Lipton, Lapidot, Shamir, Feige and Lov asz [12, 10, 11, 13, 26, 15] show that we can create a two prover one round protocol with exponentially small error equivalent to any multi prover protocol. However, the proofs work by looking at special properties of the Babai Fortnow Lund [4] protocol instead of showing how to parallelize general multiprover protocols. We ....

J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the 5th IEEE Structure in Complexity Theory Conference, pages 45--54. IEEE, New York, 1990.

....have exponentially small error probability. It was first proposed by Fortnow, Rompel and Sipser [11] However, Fortnow [8] later observed that the polynomially many copies of the protocol are not independent, which complicates the analysis. Thus the proof in [11] is incorrect. In [6] and later in [7], the present authors studied the problem of parallelizing 2 prover interactive proof systems. Their analysis showed that any language accepted by an unbounded round, single prover interactive proof system is accepted by a 1 round, 24 prover interactive proof system with error probability at most ....

J. Cai, A. Condon and R.J. Lipton, On bounded round multi-prover interactive proof systems, Proceedings of Fifth Annual Conference on Structure in Complexity Theory, June 1990, 45-54.

No context found.

J. Cai, A. Condon, and R. Lipton. On bounded round multiprover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45--54, 1990. 13

No context found.

J. CAI, A. CONDON, AND R. LIPTON, On bounded round multi-prover interactive proof systems, in Proc. Structure in Complexity Theory, 1990, IEEE Computer Society Press, Los Alamitos, CA, pp. 45--54.

No context found.

J. Cai, A. Condon, and R. Lipton. On bounded round multi-prover interactive proof systems. In Proceedings of the Fifth Annual Conference on Structure in Complexity Theory, pages 45-54, 1990.

No context found.

J. CAI, A. CONDON, AND R. LIPTON, On bounded round multi-prover interactive proof systems, in Proc. Structure in Complexity Theory, 1990, IEEE Computer Society Press, Los Alamitos, CA, pp. 45--54.

No context found.

J. Cai, A. Condon, R. Lipton, "On Bounded Round Multi-Prover Interactive Proof Systems", Structures 90, 45--54.

No context found.

J. Cai, A. Condon, R. Lipton. "On Bounded Round Multi-Prover Interactive Proof Systems." Proc. of Structure in Complexity, 1990, pp. 45-54.

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