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].
No takes yet. Share an insight, caveat, or question.
Lund et al. (1992) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: