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

4 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2021 · cs.CCShow all

1 paper · 2 filters

cs.CC2021

Strong Parallel Repetition for Unique Games on Small Set Expanders

Dana Moshkovitz

Strong Parallel Repetition for Unique Games on Small Set Expanders The strong parallel repetition problem for unique games is to efficiently reduce the 1-delta vs. 1-C*delta gap pr…