A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
From MaRDI portal
Publication:2947570
DOI10.1145/2382559.2382561zbMath1322.94090OpenAlexW2014898899MaRDI QIDQ2947570
Muthuramakrishnan Venkitasubramaniam, Rafael Pass
Publication date: 24 September 2015
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2382559.2382561
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)
Related Items (1)
This page was built for publication: A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs