Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronic colloquium on computational complexity

(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games.

Justin Holmgren, Lisa Yang

Published Jan 1, 2017• 5 citations
OpenAlex

Related papers

Characterizing Parallel Repetition of Non-Signaling Games: Counterexamples and a Dichotomy Theorem.

Justin Holmgren, Lisa Yang

Electronic colloquium on computational complexity•Jan 1, 2018•1 citation

Parallel Repetition for 3-Player 𝘟𝘖𝘙 Games

Amey Bhangale, Mark Braverman, Subhash Khot +2 more

ACM Symposium on Theory of Computing (STOC)•Jun 15, 2025•0 citations

A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof.

Uma Girish, Justin Holmgren, Kunal Mittal +2 more

Electronic colloquium on computational complexity•Jan 1, 2021•0 citations

Strong Parallel Repetition Theorem for Free Projection Games

Boaz Barak, Anup Rao, Ran Raz +2 more

Lecture notes in computer science•Jan 1, 2009•27 citations

Parallel Repetition of the Odd Cycle Game

Kooshiar Azimian, Márió Szegedy

Springer eBooks•Apr 3, 2008•4 citations

A parallel repetition theorem for entangled projection games

Irit Dinur, David Steurer, Thomas Vidick

Computational Complexity•May 18, 2015•22 citations