Approximating SVP∞ to within almost-polynomial factors is NP-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1767, Issue , 2000, Pages 263-276

  Dinur, Irit ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DIRECT REDUCTION; NP-HARD; POLYNOMIAL FACTOR;

ARTIFICIAL INTELLIGENCE;

EID: 84912137975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_22     Document Type: Article

References (17)

1. [ABSS93] S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 724-733, 1993.
2. [Ajt96] M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th ACM Symp. on Theory of Computing, pages 99-108, 1996.
3. [Ajt98] Miklós Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 10-19, New York, May 23-26 1998. ACM Press.
4. [Bab86] L. Babai. On Lovász's lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-14, 1986.
5. [Bol86] B. Bollobás. Combinatorics. Cambridge University Press, 1986.
6. ε) is NP-hard under randomized reductions. In Proc. of the 13th Annual IEEE Conference on Computational Complexity, pages 46- 55. 1998.
7. [Coo71] S. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symp. on Theory of Computing, pages 151-158, 1971.
8. +99] Dinur, Fischer, Kindler, Raz, and Safra. PCP characterizations of NP: Towards a polynomially-small error-probability. In STOC: ACM Symposium on Theory of Computing (STOC), 1999.
9. [DKRS99] I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating-CVP to within almost-polynomial factors is NP-hard. Manuscript, 1999.
10. [DKS98] Dinur, Kindler, and Safra. Approximating-CVP to within almost- polynomial factors is NP-hard. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), 1998.
11. [FT85] András Frank and Éva Tardos. An application of simultaneous approximation in combinatorial optimization. In 26th Annual Symposium on Foundations of Computer Science, pages 459-463, Portland, Oregon, 21- 23 October 1985. IEEE.
12. [GG98] O. Goldreich and S. Goldwasser. On the limits of non-approximability of lattice problems. In Proc. 30th ACM Symp. on Theory of Computing, pages 1-9, 1998.
13. [Lev73] L. Levin. Universal'nyĭe perebornyĭe zadachi (universal search problems: in Russian). Problemy Peredachi Informatsii, 9(3):265-266, 1973.
14. [LLL82] A.K. Lenstra, H.W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261:513-534, 1982.
15. [L085] J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Journal of the ACM, 32(l):229-246, January 1985.
16. [Mic98] D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. In Proc. 39th IEEE Symp. on Foundations of Computer Science, 1998.
17. [Sch85] C.P. Schnorr. A hierarchy of polynomial-time basis reduction algorithms. In Proceedings of Conference on Algorithms, Pécs (Hungary), pages 375- 386. North-Holland, 1985.