Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > KUNAL MITTAL:
All reports by Author Kunal Mittal:

TR21-101 | 13th July 2021
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan

A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof

Revisions: 1

We give a new proof of the fact that the parallel repetition of the (3-player) GHZ game reduces the value of the game to zero polynomially quickly. That is, we show that the value of the $n$-fold GHZ game is at most $n^{-\Omega(1)}$. This was first established by Holmgren and ... more >>>


TR20-173 | 18th November 2020
Kunal Mittal, Ran Raz

Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines

Revisions: 1

We prove that a sufficiently strong parallel repetition theorem for a special case of multiplayer (multiprover) games implies super-linear lower bounds for multi-tape Turing machines with advice. To the best of our knowledge, this is the first connection between parallel repetition and lower bounds for time complexity and the first ... more >>>




ISSN 1433-8092 | Imprint