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...Show MoreMetadata
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.<>
Date of Conference: 30 June 1991 - 03 July 1991
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-8186-2255-5
