On the Parallel Repetition of Multi-Player Games: The No-Signaling Case
暂无分享,去创建一个
[1] Noga Alon,et al. Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs , 1997, J. Comb. Theory, Ser. A.
[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[3] Ricky Rosen. A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model , 2010, COCOON.
[4] Ran Raz,et al. A parallel repetition theorem , 1995, STOC '95.
[5] S. Wehner,et al. A monogamy-of-entanglement game with applications to device-independent quantum cryptography , 2012, 1210.4359.
[6] Julia Kempe,et al. Unique Games with Entangled Provers are Easy , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[7] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[8] Klaus Jansen,et al. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings , 2009, APPROX-RANDOM.
[9] Serge Fehr,et al. The garden-hose model , 2011, ITCS '13.
[10] David Steurer,et al. A Parallel Repetition Theorem for Entangled Projection Games , 2014, Computational Complexity Conference.
[11] Troy Lee,et al. Multipartite entanglement in XOR games , 2013, Quantum Inf. Comput..
[12] Thomas Holenstein. Parallel Repetition: Simplification and the No-Signaling Case , 2009, Theory Comput..
[13] Julia Kempe,et al. Parallel repetition of entangled games , 2011, STOC '11.
[14] William Slofstra,et al. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[15] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[16] Rafail Ostrovsky,et al. Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..
[17] 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).
[18] Ran Raz,et al. Strong Parallel Repetition Theorem for Free Projection Games , 2009, APPROX-RANDOM.
[19] Anup Rao,et al. Parallel repetition in projection games and a concentration bound , 2008, SIAM J. Comput..
[20] David Steurer,et al. A parallel repetition theorem for entangled projection games , 2013, computational complexity.
[21] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[22] André Chailloux,et al. Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost , 2014, ICALP.
[23] Anup Rao. Parallel Repetition in Projection Games and a Concentration Bound , 2011, SIAM J. Comput..