Probabilistic Proof Systems -- A Survey (1996)

by Oded Goldreich
Venue:IN SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
Citations:5 - 0 self

Active Bibliography

15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
Probabilistic Proof Systems: A Primer – Oded Goldreich - 2008
718 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
13 The approximability of NP-hard problems – Sanjeev Arora - 1998
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
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
7 Robust PCPs of proximity and shorter PCPs – Prahladh Harsha - 2004
1 How NP Got a New Definition: A Survey of Probabilistically Checkable Proofs ∗ – Sanjeev Arora - 2003
208 Free Bits, PCPs and Non-Approximability -- Towards Tight Results – Mihir Bellare, Oded Goldreich, Madhu Sudan - 1996
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
29 Randomness, Interactive Proofs and . . . – Oded Goldreich - 1987
15 A Combinatorial Consistency Lemma with application to proving the PCP Theorem – Oded Goldreich, Shmuel Safra - 1997
2 On the Role of Algebra in the Efficient Verification of Proofs – Madhu Sudan - 1994
Efficient Checking of Polynomials and Proofs – Madhu Sudan, Madhu Sudan
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser - 1994
33 Clique is Hard to Approximate within ... – Johan Håstad - 2002
648 Some optimal inapproximability results – Johan Håstad - 2002