Author:
Lund Carsten,Fortnow Lance,Karloff Howard,Nisan Noam
Abstract
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP = PSPACE [28] and that MIP = NEXP [4].
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference33 articles.
1. ~AIELLO W. GOLDWASSER S. AND H~xSTAD J. On the power of interaction. Combinatorica ~10 1 (1992) 3-25. ~AIELLO W. GOLDWASSER S. AND H~xSTAD J. On the power of interaction. Combinatorica ~10 1 (1992) 3-25.
2. a new method in structural complexity theory. ~Computat;~BABAI L.;Complex.,1991
3. Non-deterministic exponential time has two-prover ~interactive protocols. Comp,tat;~BABAI L.;Complex.,1991
4. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Cited by
397 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献