Derandomized parallel repetition theorems for free games

DOI10.1007/s00037-013-0071-yzbMath1290.68043MaRDI QIDQ371195

Ronen Shaltiel

Publication date: 30 September 2013

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-013-0071-y

zbMATH Keywords

derandomization; 2-prover systems; parallel repetition; randomness extractors

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)