scientific article; zbMATH DE number 7378661
From MaRDI portal
Publication:5009546
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.49MaRDI QIDQ5009546
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Randomness in interactive proofs
- On interactive proofs with a laconic prover
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
- Low-End Uniform Hardness versus Randomness Tradeoffs for AM
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- IP = PSPACE
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
This page was built for publication: