Title :
PSPACE is provable by two provers in one round
Author :
Cai, Jin-Yi ; Condon, Anne ; Lipton, Richard J.
Author_Institution :
Dept., of Comput. Sci., Princeton Univ., NJ, USA
fDate :
30 Jun-3 Jul 1991
Abstract :
It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved
Keywords :
computational complexity; formal languages; program verification; PSPACE; correctness; error probability; language; one-round; two-prover interactive proof; unbounded round interactive proof system; Computer science; Contracts; Error correction; Error probability; Polynomials; Protocols;
Conference_Titel :
Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2255-5
DOI :
10.1109/SCT.1991.160250
