Non-Deterministic Exponential Time has Two-Prover Interactive Protocols

by Laszlo Babai , Lance Fortnow , Carsten Lund
Citations:398 - 40 self

Active Bibliography

10 The Power Of Interaction – Carsten Lund - 1991
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
18 E-mail and the unexpected power of interaction – László Babai - 1988
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
305 Algebraic Methods for Interactive Proof Systems – Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan - 1990
112 BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs (Extended Abstract) – Laszlo Babai, Noam Nissan, Lance Fortnow, Avi Wigderson - 1993
13 The approximability of NP-hard problems – Sanjeev Arora - 1998
1 How NP Got a New Definition: A Survey of Probabilistically Checkable Proofs ∗ – Sanjeev Arora - 2003
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
46 Arithmetization: A New Method In Structural Complexity Theory – László Babai, Lance Fortnow - 1991
5 Probabilistic Proof Systems -- A Survey – Oded Goldreich - 1996
7 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
49 Some Applications of Coding Theory in Computational Complexity – Luca Trevisan - 2004
68 Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems – Madhu Sudan - 1992
9 On helping and interactive proof systems – V. Arvind, J. Köbler, R. Schuler - 1995
19 Complexity-Theoretic Aspects of Interactive Proof Systems – Lance Jeremy Fortnow - 1989
3 Fast approximate PCPs – Funda Ergün, Ravi Kumar, Ronitt Rubinfeld - 1999