Pages that link to "Item:Q1341733"

The following pages link to On the power of multi-prover interactive protocols (Q1341733):

Displaying 36 items.

• Derandomized parallel repetition theorems for free games (Q371195) (← links)
• Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
• On the power of interaction (Q751809) (← links)
• Model independent approach to probabilistic models (Q831149) (← links)
• Checking the correctness of memories (Q890427) (← links)
• Multi-oracle interactive protocols with constant space verifiers (Q1190986) (← links)
• PSPACE is provable by two provers in one round (Q1318475) (← links)
• A note on PCP vs. MIP (Q1350618) (← links)
• Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
• Quantum multi-prover interactive proof systems with limited prior entanglement. (Q1401955) (← links)
• Interactive and probabilistic proof-checking (Q1577488) (← links)
• Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
• Multi-prover encoding schemes and three-prover proof systems (Q1816732) (← links)
• PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
• Fast approximate probabilistically checkable proofs (Q1881217) (← links)
• The complexity of approximating a nonlinear program (Q1906280) (← links)
• Simulating BPP using a general weak random source (Q1923854) (← links)
• A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence (Q2102080) (← links)
• A parallel repetition theorem for entangled projection games (Q2351389) (← links)
• Multi-prover interactive proofs: unsound foundations (Q2412247) (← links)
• LWPP and WPP are not uniformly gap-definable (Q2495405) (← links)
• On the power of many one-bit provers (Q2986871) (← links)
• Short Locally Testable Codes and Proofs (Q3088191) (← links)
• Interactive Oracle Proofs (Q3181021) (← links)
• On Dinur’s proof of the PCP theorem (Q3430210) (← links)
• Interactive proof systems (Q3830531) (← links)
• Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
• Parallel repetition via fortification: analytic view and the quantum case (Q4638072) (← links)
• Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
• Some recent strong inapproximability results (Q5054856) (← links)
• Anchored Parallel Repetition for Nonlocal Games (Q5067446) (← links)
• (Q5075766) (← links)
• REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM (Q5249275) (← links)
• Advances in Cryptology – CRYPTO 2004 (Q5311535) (← links)
• Interactive proofs with competing teams of no-signaling provers (Q5414626) (← links)
• The Complexity of Zero Knowledge (Q5458822) (← links)