Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, “Proof verification and intractability of approximation problems,” J. of the ACM, 45, No. 3, 501–555 (1998).
2. O. Goldreich, S. Goldwasser, and D. Ron, “Property testing and its connection to learning and approximation abstract,” J. of the ACM, 45, No. 4, 653–750 (1998).
3. O. Goldreich and M. Sudan, “Locally testable codes and PCPs of almost-linear length,” J. of the ACM, 53, No. 4, 558–655 (2006).
4. J. Hastad, “Some optimal inapproximability results,” J. of the ACM, 48, No. 4, 798–859 (2001).
5. J. Hastad, Complexity Theory, Proofs, and Approximation, European Congress of Mathematics, Stockholm, Sweden (2005).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献