On the Unique Games Conjecture (Invited Survey)

Authors:
Subhash Khot
Affiliations:
-
Venue:
CCC '10 Proceedings of the 2010 IEEE 25th Annual Conference on Computational Complexity
Year:
2010

Citing 0
Cited 5

Semidefinite programming and approximation algorithms: a survey

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Solution of the propeller conjecture in R3

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of finite-valued CSPs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The power of linear programming for finite-valued CSPs: a constructive characterization

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Robust Satisfiability for CSPs: Hardness and Algorithmic Results

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry.