Derandomized parallel repetition theorems for free games
type: Item
instance of: scholarly article
title: Derandomized parallel repetition theorems for free games
zbMATH Open document ID: 1290.68043
author: Ronen Shaltiel
published in: Computational Complexity
publication date: 2013-09-30T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6212886
zbMATH Keywords: parallel repetition
zbMATH Keywords: 2-prover systems
zbMATH Keywords: derandomization
zbMATH Keywords: randomness extractors
MaRDI profile type: Publication
full work available at URL: s00037-013-0071-y
OpenAlex ID: W2134409102
cites work: Randomness in interactive proofs
cites work: Strong Parallel Repetition Theorem for Free Projection Games
cites work: A one-round, two-prover, zero-knowledge protocol for NP
cites work: Randomized graph products, chromatic numbers, and Lovasz j-function
cites work: Q4234094
cites work: Error reduction by parallel repetition - a negative result
cites work: On the power of multi-prover interactive protocols
cites work: A Sample of Samplers: A Computational Perspective on Sampling
cites work: On Yao’s XOR-Lemma
cites work: Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
cites work: Q3549639
cites work: Q4252738
cites work: Q5302082
cites work: Q4526985
cites work: Communication Complexity
cites work: Products and Help Bits in Decision Trees
cites work: Randomness is linear in space
cites work: Q4527004
cites work: Q3549674
cites work: A Parallel Repetition Theorem
cites work: Towards proving strong direct product theorems
cites work: Q4372786
DOI: 10.1007/S00037-013-0071-Y
Recommended article: Strong Parallel Repetition Theorem for Free Projection Games
Recommended article: Parallel Repetition for the GHZ Game: A Simpler Proof.
Recommended article: Parallel Repetition of Two-Prover One-Round Games: An Exposition
Recommended article: Parallel Repetition in Projection Games and a Concentration Bound
Recommended article: Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)
Recommended article: A randomized subexponential algorithm for parity games
Recommended article: A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian
Recommended article: Q5005142
Recommended article: A Folk Theorem for Asynchronously Repeated Games
Recommended article: Memoryless Determinacy of Parity Games
description: scientific article; zbMATH DE number 6212886