Sciweavers

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

128

Voted

STOC
2007
ACM

121views Algorithms» more STOC 2007»

An efficient parallel repetition theorem for Arthur-Merlin games

16 years 3 months ago

An efficient parallel repetition theorem for Arthur-Merlin games

Download www.iacr.org

Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Real-time Traffic

Algorithms | Parallel Repetition Theorem | STOC 2007 |

claim paper

Related Content

» An Efficient Parallel Repetition Theorem

» Strong Parallel Repetition Theorem for Free Projection Games

» Derandomized Parallel Repetition Theorems for Free Games

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

» A Strong Parallel Repetition Theorem for Projection Games on Expanders

» A Counterexample to Strong Parallel Repetition

» Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems

» Unique Games with Entangled Provers are Easy

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Rafael Pass, Muthuramakrishnan Venkitasubramaniam

Comments (0)