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

De Gruyter eBooks

8. Parallel repetitions

Published Feb 13, 2015• 0 citations
Publisher
DOI
10.1515/9783110411942.177

Related papers

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

Parallel Repetition From Fortification

Moshkovitz Aaronson, Dana Hadar

•Oct 1, 2014•0 citations

Parallel Repetition of the Odd Cycle Game

Kooshiar Azimian, Márió Szegedy

Springer eBooks•Apr 3, 2008•4 citations

Showcase: Non-signalling Parallel Repetition

Rotem Arnon-Friedman

Springer theses•Jan 1, 2020•0 citations

Error Reduction by Parallel Repetition—A Negative Result

Uriel Feige, Oleg Verbitsky

COMBINATORICA•Oct 1, 2002•36 citations

Analytical approach to parallel repetition

Irit Dinur, David Steurer

We propose an analytical framework for studying parallel repetition, a basic product operation for one-round twoplayer games. In this framework, we consider a relaxation of the value of projection games. We show that this relaxation is multiplicative with respect to parallel repetition and that it provides a good approximation to the game value. Based on this relaxation, we prove the following improved parallel repetition bound: For every projection game G with value at most ρ, the k-fold parallel repetition G⊗k has value at most

ACM Symposium on Theory of Computing (STOC)•May 31, 2014•523 citations
We propose an analytical framework for studying parallel repetition, a basic product operation for one-round twoplayer games. In this framework, we consider a relaxation of the value of projection games. We show that this relaxation is multiplicative with respect to parallel repetition and that it provides a good approximation to the game value. Based on this relaxation, we prove the following improved parallel repetition bound: For every projection game G with value at most ρ, the k-fold parallel repetition G⊗k has value at most