Active Bibliography

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
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.), Shafi Goldwasser - 1994
17 Transparent Proofs and Limits to Approximation – László Babai - 1994
The Computational Complexity Column – Lance Fortnow Nec, Lance Fortnow, Lance Fortnow, Steve Homer
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale
Probabilistic Proof Systems: A Primer – Oded Goldreich - 2008
5 Probabilistic Proof Systems -- A Survey – Oded Goldreich - 1996
26 Inapproximability of combinatorial optimization problems – Luca Trevisan - 2004
11 A Short History of Computational Complexity – Lance Fortnow, Steve Homer - 2002
15 A Taxonomy of Proof Systems – Oded Goldreich - 1997
1 How NP Got a New Definition: A Survey of Probabilistically Checkable Proofs ∗ – Sanjeev Arora - 2003
4 Probabilistically Checkable Proofs and their Consequences for Approximation Algorithms – S. Hougardy, H.J. Prömel, A. Steger - 1995
Efficient Checking of Polynomials and Proofs – Madhu Sudan, Madhu Sudan
68 Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems – Madhu Sudan - 1992
4 On Dinur’s Proof of the PCP Theorem – Jaikumar Radhakrishnan, Madhu Sudan - 2006
64 Computational Complexity: A Conceptual Perspective – Oded Goldreich - 2006
A Glossary of Complexity Classes – n.n.
101 Hardness Of Approximations – Sanjeev Arora , Carsten Lund - 1996