Active Bibliography

723 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
660 Some optimal inapproximability results – Johan Håstad - 2002
16 The approximability of NP-hard problems – Sanjeev Arora - 1998
658 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
General Terms – Madhu Sudan
368 Probabilistic checking of proofs: a new characterization of NP – Sanjeev Arora - 1998
The Weizmann Workshop on Probabilistic Proof Systems – Uriel Feige, Shafi Goldwasser (Eds.) - 1994
16 Transparent Proofs and Limits to Approximation – László Babai - 1994
1 NP and Mathematics - a computational complexity perspective – Avi Wigderson, Steve Smale