Unique games conjecture

Known as: UGC (disambiguation) 
In computational complexity theory, the Unique Games Conjecture is a conjecture made by Subhash Khot in 2002. The conjecture postulates that the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Covering spaces of graphs have long been useful for studying expanders (as “graph lifts”) and unique games (as the “label… (More)
Is this relevant?
2017
2017
We prove the endpoint case of a conjecture of Khot and Moshkovitz related to the Unique Games Conjecture, less a small error. Let… (More)
  • figure 1
Is this relevant?
2011
2011
In 2002, Subhash Khot formulated the Unique Games Conjecture, a conjecture about the computational complexity of certain… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
The edge expansion of a subset of vertices S ⊆ V in a graph G measures the fraction of edges that leave S. In a d-regular graph… (More)
Is this relevant?
Review
2010
Review
2010
In the last lecture, we proved an inapproximability result for the MAX-CUT problem. We also introduced the unique label cover… (More)
  • figure 1
Is this relevant?
2008
2008
We examine the hardness of approximating constraint satisfaction problems with k-variable constraints, known as k-CSP’s. We are… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The… (More)
  • figure 1
Is this relevant?
Review
2005
Review
2005
  • Subhash Khot
  • IEEE 25th Annual Conference on Computational…
  • 2005
This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In this article, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into ℓ<sub>1</sub… (More)
  • figure 7
Is this relevant?