A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
Consider a m-round interactive protocol with soundness error 1/2. How much extra randomness is required to decrease the soundness error to δ through parallel repetition? Previous work, initiated by Bellare, Goldreich and Goldwasser, shows that for public-coin interactive protocols with statistical soundness, m · O(log(1/δ)) bits of extra randomness suffices. In this work, we initiate a more general study of the above question. • We establish the first derandomized parallel repetition theoremdoi:10.1109/focs.2011.93 dblp:conf/focs/ChungP11 fatcat:c66rwhdzvjb3nctvhxuejeprwu