Sciweavers

APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 6 months ago
Improved Rounding for Parallel Repeated Unique Games
We show a tight relation between the behavior of unique games under parallel repetition and their semidefinite value. Let G be a unique game with alphabet size k. Suppose the semid...
David Steurer