A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
[article]

2016
*
arXiv
*
pre-print

A (k × l)-birthday repetition G^k × l of a two-prover game G is a game in which the two provers are sent random sets of questions from G of sizes k and l respectively. These two sets are sampled independently uniformly among all sets of questions of those particular sizes. We prove the following birthday repetition theorem: when G satisfies some mild conditions, val(G^k × l) decreases exponentially in Ω(kl/n) where n is the total number of questions. Our result positively resolves an open

arXiv:1607.02986v1
fatcat:thsrikpxp5gmzpel6dd3cmjdfm