Parallel Repetition via Fortification: Analytic View and the Quantum Case
暂无分享,去创建一个
[1] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[2] Xiaodi Wu,et al. Parallel repetition for entangled k-player games via fast quantum search , 2014, CCC.
[3] David Steurer,et al. A parallel repetition theorem for entangled projection games , 2013, computational complexity.
[4] Thomas Vidick,et al. Three-Player Entangled XOR Games Are NP-Hard to Approximate , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[5] Avi Wigderson,et al. Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.
[6] Ramprasad Saptharishi,et al. On Fortification of Projection Games , 2015, APPROX-RANDOM.
[7] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[8] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[9] L. Fortnow,et al. On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[10] Tsuyoshi Ito,et al. A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[11] Serge Fehr,et al. On the Parallel Repetition of Multi-Player Games: The No-Signaling Case , 2013, TQC.
[12] Thomas Vidick,et al. Non-Signaling Parallel Repetition Using de Finetti Reductions , 2014, IEEE Transactions on Information Theory.
[13] Ran Raz,et al. A Counterexample to Strong Parallel Repetition , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[14] Uriel Feige,et al. Two-Prover Protocols - Low Error at Affordable Rates , 2000, SIAM J. Comput..
[15] Ryan O'Donnell,et al. Understanding Parallel Repetition Requires Understanding Foams , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[16] Carsten Lund,et al. Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[17] Inequalities for the Schatten p-Norm . , .
[18] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[19] Thomas Vidick,et al. Anchoring games for parallel repetition , 2015, ArXiv.
[20] André Chailloux,et al. Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost , 2014, ICALP.
[21] Jriel Feigt. Error reduction by parallel repetition - a negative result (Preliminary version) , 1996 .
[22] Nathan Linial,et al. Lifts, Discrepancy and Nearly Optimal Spectral Gap* , 2006, Comb..
[23] Andreas J. Winter,et al. Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction , 2015, Chic. J. Theor. Comput. Sci..
[24] Julia Kempe,et al. Parallel repetition of entangled games , 2011, STOC '11.
[25] A. Shimony,et al. Proposed Experiment to Test Local Hidden Variable Theories. , 1969 .
[26] Mark Braverman,et al. Small Value Parallel Repetition for General Games , 2014, STOC.
[27] Anup Rao,et al. Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..
[28] Uriel Feige,et al. Error Reduction by Parallel Repetition—A Negative Result , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).
[29] Dana Moshkovitz,et al. Parallel Repetition from Fortification , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[30] Rahul Jain,et al. A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions , 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[31] Thomas Holenstein,et al. Parallel repetition: simplifications and the no-signaling case , 2007, STOC '07.
[32] Peter Høyer,et al. Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[33] N. Linial,et al. Lifts, Discrepancy and Nearly Optimal Spectral Gaps , 2003 .