Join Our Newsletter

COCO

2010

Springer

10 years 2 months ago
2010

Springer

—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...

COCOON

2010

Springer

10 years 3 months ago
2010

Springer

The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...

FOCS

2008

IEEE

10 years 4 months ago
2008

IEEE

We show that the NP-Complete language 3SAT has a PCP veriﬁer that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...

FOCS

2008

IEEE

10 years 4 months ago
2008

IEEE

The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)...

APPROX

2009

Springer

10 years 5 months ago
2009

Springer

STOC

2007

ACM

10 years 10 months ago
2007

ACM