Journal: Electronic Colloquium on Computational Complexity (ECCC)

Volume 5, Issue 8

0 -- 0Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. Proof verification and the hardness of approximation problems