Tag: interactive-proofs

Found 26 results for 'interactive-proofs'.

1) cc.complexity-theory - Interactive Proofs via Postselection?
2) cc.complexity-theory - Interactive Proof for HORN-SAT?
3) cc.complexity-theory - Delegating all of the work to the prover in $\mathcal{MA}$ protocols
4) complexity-classes - Is the D-Wave architecture a close implementation of quantum interactive proof?
5) quantum-computing - Quantum complexity of TQBF with an untrusted oracle
6) cc.complexity-theory - Landscape of interactive proof systems
7) cc.complexity-theory - Is there a continuous version of parallel repetition theorem
8) cc.complexity-theory - Arthur-Merlin protocol with BQP power
9) cc.complexity-theory - If P = BQP, does this imply that PSPACE (= IP) = AM?
10) cc.complexity-theory - What's the "real" reason that IP=PSPACE is non-relativizing?
11) cc.complexity-theory - One-sided errors in probablistic proof systems
12) cc.complexity-theory - Can Merlin convince Arthur about a certain sum?
13) interactive-proofs - Is there a constructive parallel repetition theorem for nice MIP protocols?
14) quantum-computing - Simulating quantum measurements by unitaries
15) cc.complexity-theory - Separation of AM and SZK
16) cc.complexity-theory - What is known about multi-prover interactive proofs with short messages?
17) cc.complexity-theory - What is the Relationship between QMA and AM?
18) interactive-proofs - Does the MIP* = RE proof work for limited provers?
19) cc.complexity-theory - MIP with efficient provers
20) interactive-proofs - How to define a function inductively on two arguments in Coq?
21) cc.complexity-theory - Parity P and AM
22) cc.complexity-theory - Interactive proofs for levels of the polynomial hierarchy
23) derandomization - If $P=BPP$, then Is it correct that $IP=NP$?
24) interactive-proofs - Is there a version of MIP=NEXP with relatively efficient provers?
25) cr.crypto-security - NIZK proofs: Why is the prove function necessary?
26) quantum-computing - From CHSH inequality to CHSH game