A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian
international workshop and international workshop on approximation randomization and combinatorial optimization algorithms and techniques, 2016.
In this work we show a barrier towards proving a randomness-efficient parallel repetition, a promising avenue for achieving many tight inapproximability results. Feige and Kilian (STOCu002795) proved an impossibility result for randomness-efficient parallel repetition for two prover games with small degree, i.e., when each prover has only...More
PPT (Upload PPT)