Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
Computational Complexity
Understanding Parallel Repetition Requires Understanding Foams
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
Towards Sharp Inapproximability For Any 2-CSP
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A Counterexample to Strong Parallel Repetition
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Rounding Parallel Repetitions of Unique Games
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Graph expansion and the unique games conjecture
Proceedings of the forty-second ACM symposium on Theory of computing
Hi-index | 0.00 |
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 semidefinite value of G, denoted sdp(G), is at least 1 - ε. Then, we show that the optimal value opt(Gl) of the l-fold repetition of G is at least 1 - O(√lε log k). This bound confirms a conjecture of Barak et al. (2008), who showed a lower bound that was worse by √lε log(1/ε). A consequence of our bound is the following tight relation between the semidefinite value of G and the amortized value opt(G) := supl∈IN opt(Gl)1/l, sdp(G)O(log k) ≤ opt(G) ≤ sdp(G). The proof closely follows the approach of Barak et al. (2008). Our technical contribution is a natural orthogonalization procedure for nonnegative functions. The procedure has the property that it preserves distances up to an absolute constant factor. In particular, our orthogonalization avoids the additive increase in distances caused by the truncation step of Barak et al. (2008).