MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the Unique Games Conjecture." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

74 documents found, showing 1 through 10. Next 10 →

ATOM

The unique game conjecture with entangled provers is false
by Julia Kempe, Oded Regev, Ben Toner — 2007
…��The Unique Games Conjecture with Entangled Provers is False Julia Kempe �� Oded Regev �� Ben Toner…
Cited by 3 (1 self) – Add To MetaCart

The unique games conjecture, integrality gap for cut problems and embeddability of negative type
by Subhash A. Khot, Nisheeth K. Vishnoi — 2005 — In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science
…��The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type…
Cited by 62 (5 self) – Add To MetaCart

On the Hardness of Approximating Multicut and Sparsest-Cut
by Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar — 2005 — In Proceedings of the 20th Annual IEEE Conference on Computational Complexity
…, assuming the Unique Games Conjecture of Khot [STOC, 2002]. A quantitatively stronger version…
Cited by 37 (2 self) – Add To MetaCart

On the power of unique 2-prover 1-round games
by Subhash Khot — 2002 — In Proceedings of the 34th Annual ACM Symposium on Theory of Computing
… games, which we call the Unique Games Conjecture : The Unique Games Conjecture : For arbitrarily small…
Cited by 100 (8 self) – Add To MetaCart

Approximation Algorithm for the Max k-CSP Problem
by Moses Charikar, Konstantin Makarychev, Yury Makarychev — 2006
… the upper bound of Samorodnitsky and Trevisan up to a constant factor (their result assumes the Unique Games…
Cited by 2 (0 self) – Add To MetaCart

Near-optimal algorithms for Unique Games
by Moses Charikar, Konstantin Makarychev, Yury Makarychev — 2006 — In Proceedings of the 38th Annual ACM Symposium on Theory of Computing
… generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard…
Cited by 12 (2 self) – Add To MetaCart

Vol. 38, No. 6, pp. 2487��2498 c �� 2009 Society for Industrial and Applied Mathematics IMPROVED LOWER BOUNDS FOR EMBEDDINGS INTO L1 ��
by Robert Krauthgamer, Yuval Rabani
… that under Khot��s unique games conjecture [21] the sparsest cut problem is NP-hard to approximate within any…
Add To MetaCart

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs
by Subhash Khot, Guy Kindler, Elchanan Mossel — 2004 — In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science
…. This result is conditional, relying on two conjectures: a) the Unique Games conjecture of Khot [24]; and, b) a…
Cited by 66 (16 self) – Add To MetaCart

Parallel repetition in projection games and a concentration bound
by Anup Rao — 2008 — In Proc. 40th STOC
… of this bound is that the Unique Games Conjecture of Khot [Kho02] is equivalent to: Unique Games Conjecture…
Cited by 9 (4 self) – Add To MetaCart

Complexity and approximation of the minimum recombination haplotype configuration problem
by Lan Liu, Xi Chen, Jing Xiao, Tao Jiang — 2005 — Proc. 16th International Symposium on Algorithms and Computation (ISAAC��05
… ratio under the Unique Games Conjecture and can be approximated within ratio O( log(n) ). Our L…
Cited by 2 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB