Author:
Alimonti Paola,Kann Viggo
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. M. Ajtai, Recursive construction for 3-regular expanders, Proc. 28th Ann. IEEE Symp. on Foundations of Comput. Sci., 1987 pp. 295–304.
2. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theoret. Comput. Sci.,1995
3. S. Arora, S. Safra, Probabilistic checking of proof: a new characterization of NP, Proc. 33rd Annual IEEE Symp. on the Foundations of Computer Science, 1992, pp. 2–13.
4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Approximate Solution of NP-Hard Optimization Problems, Springer, Berlin, 1988, to appear.
5. M. Bellare, O. Goldreich, M. Sudan, Free Bits, PCPs and non-approximability-towards tight results, Proc. of the 36th Annual IEEE Conf. on Foundations of Computer Science, 1995, pp. 422–431.
Cited by
248 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献