Author:
Alekhnovich Michael,Buss Sam,Moran Shlomo,Pitassi Toniann
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, Journal of Computer and System Sciences, 54 (1997), pp. 317–331. Earlier version in Proc. 34th Symp. Found. of Comp. Sci., 1993, pp.724–733.
2. S. Arora and C. Lund, Hardness of approximations, in Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, ed., PWS Publishing Co., Boston, 1996, p. ???
3. P. Beame and T. Pitassi, Simplified and improved resolution lower bounds, in Proceedings, 37th Annual Symposium on Foundations of Computer Science, Los Alamitos, California, 1996, IEEE Computer Society, pp. 274–282.
4. M. Bellare, Proof checking and approximation: Towards tight results, SIGACT News, 27 (1996), pp. 2–13. Revised version at http://www-cse.ucsd.edu/users/mihir.
5. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, Efficient probabalistically checkable proofs and applications to approximation, in Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 1993, pp. 294–304.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献