Sciweavers

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

10

FOCS
2008
IEEE

favoriteEmaildiscussreport

91views Theoretical Computer Science» more FOCS 2008»

Rounding Parallel Repetitions of Unique Games

13 years 11 months ago

Rounding Parallel Repetitions of Unique Games

Download www.math.ias.edu

Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, O

Real-time Traffic

FOCS 2008 | Theoretical Computer Science |

claim paper

Related Content

» Improved Rounding for Parallel Repeated Unique Games

» Understanding Parallel Repetition Requires Understanding Foams

» Unique Games with Entangled Provers are Easy

» Strong Parallel Repetition Theorem for Free Projection Games

» A KProvers Parallel Repetition Theorem for a Version of NoSignaling Model

» Integrality gaps for SheraliAdams relaxations

» A Cryptographic Solution to a Game Theoretic Problem

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	FOCS
Authors	Boaz Barak, Moritz Hardt, Ishay Haviv, Anup Rao, Oded Regev, David Steurer

Comments (0)