On parallel repetition of interactive proof systems

DOI10.1007/978-3-031-88946-2_8MaRDI QIDQ6877280zbMATH OpenFDO

Authors Oded Goldreich

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-88946-2_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx)

Cites work

• Computational Complexity
• Modern cryptography, probabilistic proofs and pseudo-randomness
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds

This page was built for publication: On parallel repetition of interactive proof systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877280)