Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. N. Alon, N. Kahale: Approximating the independence number via the ?-function.Manuscript, November 1994.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy: Proof verification and hardness of approximation problems.Proc. of 33rd IEEE Symp. on Foundations of Computer Science, 1992, 14?23.
3. S. Arora, S. Safra: Probabilistic checking of proofs: a new characterization of NP.Proc. of 33rd IEEE Symp. on Foundations of Computer Science, 1992, 2?13.
4. M. Bellare, O. Goldreich, M. Sudan: Free bits, PCPs and nonapproximability-towards tight results.Proc. of 36th IEEE Symp. on Foundations of Computer Science, 1995, 422?431.
5. P. Berman, G. Schnitger: On the complexity of approximating the independent set problem,Information and Computation 96 (1992), 77?94.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献