A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In 2002, Subhash Khot formulated the Unique Games Conjecture, a conjecture about the computational complexity of certain optimization problems. The conjecture has inspired a remarkable body of work, which has clarified the computational complexity of several optimization problems and the effectiveness of "semidefinite programming" convex relaxations. In this paper, which assumes no prior knowledge of computational complexity, we describe the context and statement of the conjecture, and wedoi:10.1090/s0273-0979-2011-01361-1 fatcat:olwc5dausved3fhbgb5fn6rx5y