Author:
Feige Uriel,Micciancio Daniele
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference30 articles.
1. M. Ajtai, Generating hard instances of lattice problems (extended abstract), in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing—STOC ’96, ACM, Philadelphia, PA, USA, 1996, pp. 99–108.
2. M. Ajtai, The shortest vector problem in L_2 is NP-hard for randomized reductions (extended abstract), in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing–STOC’98, Dallas, TX, USA, 1998, pp. 10–19.
3. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora;J. Comput. System Sci.,1997
4. Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION;Berman,2002
5. The hardness of decoding linear codes with preprocessing;Bruck;IEEE Trans. Inform. Theory,1990
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献