46 search results - page 1 / 10 » Entangled Games are Hard to Approximate |
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
DAGSTUHL
2007
14 years 9 days ago
2007
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
APPROX
2008
Springer
14 years 20 days ago
2008
Springer