Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. Proof verification and the hardness of approximation problems. Electronic Colloquium on Computational Complexity (ECCC), 5(8), 1998. [doi]
Abstract is missing.