Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Parallel Repetition of Interactive Proof Systems

Oded Goldreich

Published Jan 1, 2025• 1 citation
Publisher
DOI
10.1007/978-3-031-88946-2_8

Related papers

Guest column

Kai-Min Chung, Rafael Pass

We survey recent results on parallel repetition theorems for computationally-sound interactive proofs (a.k.a. interactive arguments).

ACM SIGACT News•Mar 6, 2013•1 citation

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

Richard Cleve, William Slofstra, Falk Unger +1 more

Computational Complexity•Apr 29, 2008•93 citations

Parallelization of entanglement-resistant multi-prover interactive proofs

Tsuyoshi Ito

Information Processing Letters•May 20, 2014•5 citations

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

Itay Berman, Iftach Haitner, Eliad Tsfadia

Electronic colloquium on computational complexity•Jan 1, 2019•1 citation

An Efficient Parallel Repetition Theorem

Johan Håstad, Rafael Pass, Douglas Wikström +1 more

Lecture notes in computer science•Jan 1, 2010•46 citations

Randomness in interactive proofs

Mihir Bellare Y, Oded Goldreich, Shafi Goldwasser

Computational Complexity•Dec 1, 1993•55 citations