Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Interactive and Probabilistic Proof of Mobile Code Safety
Automated Software Engineering
Proceedings of the forty-second ACM symposium on Theory of computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
Practical verified computation with streaming interactive proofs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Entanglement in interactive proof systems with binary answers
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
Lund et al. [1] have proved that PH is contained in IP. Shamir [2] improved this technique and proved that PSPACE = IP. In this note, a slightly simplified version of Shamir's proof is presented, using degree reductions instead of simple QBFs.