activity
20032026
most citedLimits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

4 citations · 18 across the 21 of their papers we have counts for

collaborators

25 papers

quant-ph2026

Planted Cliques and Quantum Symmetry-Adapted Measurements

Vojtech Havlicek, Jordan Docter, Subhash Khot

We study how quantum encodings and symmetry-adapted measurements preserve information for planted-clique detection from one classical graph. For $k=\lfloor n^{1/2-\varepsilon}\rflo…

cs.CC2023

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…

math.CO2023★ 2 cited

Effective Bounds for Restricted -Arithmetic Progressions in

Amey Bhangale, Subhash Khot, Dor Minzer

For a prime , a restricted arithmetic progression in is a triplet of vectors in which the common difference is a non-zero element from $\{0,1…

cs.CC2023★ 1 cited

On Approximability of Satisfiable k-CSPs: IV

Amey Bhangale, Subhash Khot, Dor Minzer

We prove a stability result for general -wise correlations over distributions satisfying mild connectivity properties. More concretely, we show that if and are alphabe…

cs.CC2022★ 1 cited

Parallel Repetition for the GHZ Game: Exponential Decay

Mark Braverman, Subhash Khot, Dor Minzer

We show that the value of the -fold repeated GHZ game is at most , improving upon the polynomial bound established by Holmgren and Raz. Our result is established via…

cs.CC2022★ 1 cited

Improved Monotonicity Testers via Hypercube Embeddings

Mark Braverman, Subhash Khot, Guy Kindler +1

We show improved monotonicity testers for the Boolean hypercube under the -biased measure, as well as over the hypergrid . Our results are: 1. For any , for t…