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

Lecture notes in computer science

A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model

Ricky Rosen

Published Jan 1, 2010• 4 citations
Publisher
DOI
10.1007/978-3-642-14031-0_5

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

An Efficient Parallel Repetition Theorem

Johan Håstad, Rafael Pass, Douglas Wikström +1 more

Lecture notes in computer science•Jan 1, 2010•46 citations

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

Justin Holmgren, Lisa Yang

Electronic colloquium on computational complexity•Jan 1, 2017•5 citations

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

Richard Cleve, William Slofstra, Falk Unger +1 more

Computational Complexity•Apr 29, 2008•93 citations

Showcase: Non-signalling Parallel Repetition

Rotem Arnon-Friedman

Springer theses•Jan 1, 2020•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