.png){kind=icon}
Return
Algebraic methods for interactive proof systems
.png){kind=icon}
OA
AI
DOI：10.1145/146585.146605.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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].
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available