Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR19-014 | 22nd January 2019 05:09

A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem

RSS-Feed




TR19-014
Authors: Himanshu Tyagi, Shun Watanabe
Publication: 3rd February 2019 14:39
Downloads: 178
Keywords: 


Abstract:

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti type decomposition for strategies. We present a new proof that is based on a technique we introduced recently for proving strong converse results in multiuser information theory and entails a change of measure after replacing hard information constraints with soft ones.



ISSN 1433-8092 | Imprint