Publication | Open Access
IP = PSPACE
643
Citations
8
References
1992
Year
Cryptographic PrimitiveEngineeringInternet ProtocolCryptographyProof ComplexityFormal MethodsComputational ComplexityCommunication ComplexityPolynomial SpaceComputer ScienceVirtual Private NetworkDiscrete MathematicsRandomized AlgorithmProof SystemPhysical LayerPolynomial TimeFormal Verification
In this paper, it is proven 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 with polynomial space.
| Year | Citations | |
|---|---|---|
Page 1
Page 1