Algebraic methods for interactive proof systems

doi:10.1145/146585.146605

Algebraic methods for interactive proof systems

1992-10-01

0

OA

AI

DOI：10.1145/146585.146605

原文链接

原文求助

摘要

En 中文

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].

Algebraic methods for interactive proof systems

摘要

期刊

机构

引用论文