On Completeness and Soundness in Interactive Proof Systems (1989)

Cached

Download Links

by Martin Furer , Oded Goldreich , Yishay Mansour
Citations:21 - 1 self

Active Bibliography

164 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
5 Generalized Lowness and Highness and Probabilistic Complexity Classes – Andrew Klapper - 1989
15 Complexity-Theoretic Aspects of Interactive Proof Systems – Lance Jeremy Fortnow - 1989
26 On the Knowledge Complexity of ... – Erez Petrank, Gábor Tardos - 1996
Turing and the Development of Computational Complexity – Steven Homer, Alan L. Selman - 2011
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
3 Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy – Alan L. Selman, Samik Sengupta - 2004
13 Counting Hierarchies: Polynomial Time And Constant Depth Circuits – Eric W. Allender, Klaus W. Wagner - 1990
31 Threshold Computation and Cryptographic Security – Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf - 1995
29 Randomness in Interactive Proofs – Mihir Bellare, Oded Goldreich, Shafi Goldwasser - 1993
9 Probabilistic Computation and Linear Time – Lance Fortnow, Michael Sipser - 1997
11 Sorting Out Zero-Knowledge – Gilles Brassard, Claude Crepeau - 1990
35 One-Way Functions are Essential for Non-Trivial Zero-Knowledge(Extended Abstract) – Rafail Ostrovsky, Avi Wigderson - 1993
6 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
99 Definitions And Properties Of Zero-Knowledge Proof Systems – Oded Goldreich, Yair Oren - 1994
10 Derandomization That is Rarely Wrong From Short Advice That is Typically Good – Oded Goldreich, Avi Wigderson - 2002
97 BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs (Extended Abstract) – Laszlo Babai, Noam Nissan, Lance Fortnow, Avi Wigderson - 1993
92 Graph Nonisomorphism Has Subexponential Size Proofs Unless The Polynomial-Time Hierarchy Collapses – Adam R. Klivans, Dieter Van Melkebeek - 1998
1 My Favorite Ten Complexity Theorems of the Past Decade – Lance Fortnow