Unique Games on the Hypercube

Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan

Research output: Contribution to journalArticlepeer-review


In this paper, we investigate the validity of the Unique Games Conjecture when the constraint graph is the boolean hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite program (SDP) for Max-2-LIN(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the hypercube.
Original languageEnglish
JournalChicago Journal of Theoretical Computer Science
StatePublished - 2015


  • Unique games
  • Semi-definite programming
  • Integrality gap
  • Hypercube


Dive into the research topics of 'Unique Games on the Hypercube'. Together they form a unique fingerprint.

Cite this