Publisher
Springer Berlin Heidelberg
Reference69 articles.
1. Lecture Notes in Computer Science;N. Alon,2003
2. Lecture Notes in Computer Science;A. Ambainis,1997
3. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley (1994)
4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. JACM 45,3, 501–555 (1998);
5. Preliminary Version in 33rd FOCS, 1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献