1 citations · 3 across the 6 of their papers we have counts for
7 papers
A Counting Lemma for Somewhat Restricted 3-APs
Amey Bhangale, Subhash Khot, Yang P. Liu +1
For a prime , a somewhat restricted -AP in is a triplet , where and . We prove a counting lemma fo…
An Analytical Approach to Parallel Repetition via CSP Inverse Theorems
Amey Bhangale, Mark Braverman, Subhash Khot +3
Let be a -player game with value , whose query distribution is such that no marginal on players admits a non-trivial Abelian embedding. We show that for…
Reasonable Bounds for Combinatorial Lines of Length Three
Amey Bhangale, Subhash Khot, Yang P. Liu +1
We prove that any subset with contains a combinatorial line of length , i.e., , not all equal, with…
On Approximability of Satisfiable -CSPs: VII
Amey Bhangale, Subhash Khot, Yang P. Liu +1
Let be finite alphabets, and let be a distribution over in which the probability of each atom is at least . We prove that if $…
On Approximability of Satisfiable -CSPs: VI
Amey Bhangale, Subhash Khot, Yang P. Liu +1
We prove local and global inverse theorems for general -wise correlations over pairwise-connected distributions. Let be a distribution over such that the…
Parallel Repetition for -Player XOR Games
Amey Bhangale, Mark Braverman, Subhash Khot +2
In a - game , the verifier samples a challenge where is a probability distribution over , and a map $t\colon Σ\ti…
Parallel Repetition of k-Player Projection Games
Amey Bhangale, Mark Braverman, Subhash Khot +2
We study parallel repetition of k-player games where the constraints satisfy the projection property. We prove exponential decay in the value of a parallel repetition of projection…