On the power of multi-prover interactive protocols
From MaRDI portal
Recommendations
Cites work
- Algebraic methods for interactive proof systems
- Are there interactive protocols for co-NP languages?
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Designing programs that check their work
- Does co-NP have short interactive proofs ?
- Fully parallelized multi-prover protocols for NEXP-time
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- IP = PSPACE
- Non-deterministic exponential time has two-prover interactive protocols
- On games of incomplete information
- Optimization, approximation, and complexity classes
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(50)- Multi-oracle interactive protocols with constant space verifiers
- PSPACE is provable by two provers in one round
- A note on PCP vs. MIP
- Fully parallelized multi-prover protocols for NEXP-time
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- Interactive and probabilistic proof-checking
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Multi-prover encoding schemes and three-prover proof systems
- PSPACE has constant-round quantum interactive proof systems
- Fast approximate probabilistically checkable proofs
- The complexity of approximating a nonlinear program
- Simulating BPP using a general weak random source
- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- A parallel repetition theorem for entangled projection games
- Multi-prover interactive proofs: unsound foundations
- LWPP and WPP are not uniformly gap-definable
- On the power of many one-bit provers
- Short locally testable codes and proofs
- Interactive oracle proofs
- On Dinur’s proof of the PCP theorem
- Derandomized parallel repetition theorems for free games
- scientific article; zbMATH DE number 4106274 (Why is no real title available?)
- scientific article; zbMATH DE number 176551 (Why is no real title available?)
- scientific article; zbMATH DE number 176552 (Why is no real title available?)
- scientific article; zbMATH DE number 512981 (Why is no real title available?)
- scientific article; zbMATH DE number 2077106 (Why is no real title available?)
- scientific article; zbMATH DE number 1555928 (Why is no real title available?)
- Fault-tolerance and complexity (extended abstract)
- Parallel repetition via fortification: analytic view and the quantum case
- ON HELPING AND INTERACTIVE PROOF SYSTEMS
- Short locally testable codes and proofs: a survey in two parts
- Some recent strong inapproximability results
- Anchored parallel repetition for nonlocal games
- Non-cooperative rational interactive proofs
- REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM
- Advances in Cryptology – CRYPTO 2004
- Interactive proofs with competing teams of no-signaling provers
- The Complexity of Zero Knowledge
- Alternation in interaction
- Structural complexity of rational interactive proofs
- Non-deterministic exponential time has two-prover interactive protocols
- Alphabet reduction for reconfiguration problems
- Permutation argument via bases transformation
- On approximate reconfigurability of label cover
- On the structure of learnability beyond \textsf{P/poly}
- Block rigidity: strong multiplayer parallel repetition implies super-linear lower bounds for Turing machines
- Parallel repetition for the \textsf{GHZ} game: exponential decay
- On the power of interaction
- Model independent approach to probabilistic models
- Checking the correctness of memories
This page was built for publication: On the power of multi-prover interactive protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341733)
