A. Shamir, "IP = PSPACE", in Proceedings, 31st Annual IEEE Symposium on Foundations of Computer Science, pages 11-15, 1990. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Decision Algorithms for Multiplayer Non-Cooperative Games.. - Peterson, Reif, Azhar (Correct)
Relativized Perfect Zero Knowledge is not BPP. - Aiello, Hastad (1992) (1 citation) (Correct)
A Relationship between One-Wayness and Correlation Intractability - Hada, Tanaka (1999) (2 citations) (Correct)
Games, Complexity Classes, and Approximation Algorithms - Feigenbaum (1998) (Correct)
A Game-Theoretic Classification of Interactive Complexity.. - Feigenbaum, Koller, Shor (1995) (1 citation) (Correct)
A Formalization of the Turing Test - Bradford, Wollowski (Correct)
On Defining Proofs of Knowledge - Bellare, Goldreich (1992) (41 citations) (Correct)
Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994) (156 citations) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (33 citations) (Correct)
Self-Testing/Correcting with Applications to Numerical.. - Blum, Luby, Rubinfeld (1990) (55 citations) (Correct)
The Weizmann Workshop on Probabilistic Proof Systems - Feige, (Eds.) (1994) (Correct)
On the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk (1990) (85 citations) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC