A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments

Itay Berman, Iftach Haitner, Eliad Tsfadia. A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electronic Colloquium on Computational Complexity (ECCC), 26:49, 2019. [doi]

@article{BermanHT19-0,
  title = {A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments},
  author = {Itay Berman and Iftach Haitner and Eliad Tsfadia},
  year = {2019},
  url = {https://eccc.weizmann.ac.il/report/2019/049},
  researchr = {https://researchr.org/publication/BermanHT19-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {26},
  pages = {49},
}