Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

FOCS
2008
IEEE

85views Theoretical Computer Science» more FOCS 2008»

Entangled Games are Hard to Approximate

15 years 9 months ago

Entangled Games are Hard to Approximate

Download www.cs.tau.ac.il

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto,

Real-time Traffic

FOCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» The Unique Games Conjecture with Entangled Provers is False

» Unique Games with Entangled Provers are Easy

» On the Hardness of Approximating Multicut and SparsestCut

» Constraint Satisfaction over a NonBoolean Domain Approximation Algorithms and UniqueGames ...

» On the hardness of pricing lossleaders

» Tetris is Hard Even to Approximate

» Random Debaters and the Hardness of Approximating Stochastic Functions

» Doing Good with Spam Is Hard

» Approximating pure nash equilibrium in cut party affiliation and satisfiability games

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	FOCS
Authors	Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick

Comments (0)