Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference30 articles.
1. S. Arora, B. Bollobás, L. Lovász, Proving integrality gaps without knowing the linear program, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, FOCS 2002, Vancouver, Canada, Nov. 2002, pp. 313–322
2. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998
3. Probabilistic checking of proofs: A new characterization of NP;Arora;J. ACM,1998
4. Free bits, PCPs, and nonapproximability—Towards tight results;Bellare;SIAM J. Comput.,1998
5. M. Charikar, K. Makarychev, Y. Makarychev, Near-optimal algorithms for unique games, in: Proceedings of the 38th ACM Symposium on Theory of Computing, STOC 2006
Cited by
425 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献