Sciweavers

FOCS
1990
IEEE

IP=PSPACE

13 years 7 months ago
IP=PSPACE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated within polynomial space. This paper gives a detailed description of the proof. Besides the original paper, it is based on [Pa94] and [SchPr98]. Contents
Adi Shamir
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1990
Where FOCS
Authors Adi Shamir
Comments (0)