Approximating CVP to within almost-polynomial factors is NP-hard

Combinatorica

Volumn 23, Issue 2, 2003, Pages 205-243

  Dinur, I ^a   Kindler, G ^a   Raz, R ^b   Safra, S ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141655066     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-003-0019-y     Document Type: Article

References (19)

1. 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. MIKLÓS AJTAI and CYNTHIA DWORK: A public-key cryptosystem with worst-case/average-case equivalence; In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 284-293, El Paso, Texas, 4-6 May 1997.
3. M. AJTAI: Generating hard instances of lattice problems; In Proc. 28th ACM Symp. on Theory of Computing, pages 99-108, 1996.
4. 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.
5. SANJEEV ARORA, CARSTEN LUND, RAJEEV MOTWANI, MADHU SUDAN and MARIO SZEGEDY: Proof verification and the hardness of approximation problems, Journal of the ACM 45(3) 501-555, May 1998.
6. SANJEEV ARORA and SHMUEL SAFRA: Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM 45(1) 70-122, January 1998.
7. L. BABAI: On Lovász's lattice reduction and the nearest lattice point problem, Combinatorica 6 1-14, 1986.
8. ε) is NP-hard under randomized reductions; In Proc. of the 13th Annual IEEE Conference on Computational Complexity, pages 46-55, 1998.
9. S. COOK: The complexity of theorem-proving procedures; In Proc. 3rd ACM Symp. on Theory of Computing, pages 151-158, 1971.
10. I. DINUR, E. FISCHER, G. KINDLER, R. RAZ and S. SAFRA: POP characterizations of NP: Towards a polynomially-sniall error-probability; In Proc. 31st ACM Symp. on Theory of Computing, 1999.
11. 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.
12. O. GOLDREICH, D. MICCIANCIO, S. SAFRA and J.-P. SEIFERT: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, Inform. Process. Lett. 71(2) 55-61, 1999.
13. L. LEVIN: Universal'nyǐe perebornyǐe zadachi (universal search problems: in Russian), Problemy Peredachi Informatsii 9(3) 265-266, 1973.
14. A. K. LENSTRA, H. W. LENSTRA and L. LOVÁSZ: Factoring polynomials with rational coefficients, Math. Ann. 261 513-534, 1982.
15. J. LAGARIAS, H. W. LENSTRA and C. P. SCHNORR: Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica 10 333-348, 1990.
16. D. MICCIANCIO: The shortest vector in a lattice is hard to approximate to within some constant, In Proc. 99th IEEE Symp. on Foundations of Computer Science, 1998.
17. R. RAZ and S. SAFRA: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP; In Proc. 29th ACM Symp. on Theory of Computing, pages 475-484, 1997.
18. 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.
19. P. VAN EMDE BOAS: Another NP-complete problem and the complexity of computing short vectors in a lattice, Technical Report 81-04, Math. Inst. Univ. Amsterdam, 1981.