journal article Feb 01, 1989

The Knowledge Complexity of Interactive Proof Systems

Topics

No keywords indexed for this article. Browse by subject →

Cited By
2,063
Journal of Cybersecurity
Quantum
Metrics
2,063
Citations
7
References
Details
Published
Feb 01, 1989
Vol/Issue
18(1)
Pages
186-208
Cite This Article
Shafi Goldwasser, Silvio Micali, Charles Rackoff (1989). The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1), 186-208. https://doi.org/10.1137/0218012
Related

You May Also Like

Depth-First Search and Linear Graph Algorithms

Robert Tarjan · 1972

4,499 citations

Sparse Approximate Solutions to Linear Systems

B. K. Natarajan · 1995

1,969 citations

Fast Pattern Matching in Strings

Donald E. Knuth, James H. Morris, Jr. · 1977

1,950 citations

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · 1973

1,891 citations