Lattice problems in NP ∩ coNP

Journal of the ACM

Volumn 52, Issue 5, 2005, Pages 749-765

  Aharonov, Dorit ^a   Regev, Oded ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Approximation; Fourier series; Lattices

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CRYSTAL LATTICES; FUNCTIONS; VECTORS;

FOURIER SERIES; LATTICE PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 27344461174     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1089023.1089025     Document Type: Article

References (32)

1. AARONSON, S. 2004. Lower bounds for local search by quantum arguments. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC). ACM, New York, 465-474.
2. AHARONOV, D., AND REGEV, O. 2003. A lattice problem in quantum NP. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., 210-219.
3. AJTAI, M. 1996. Generating hard instances of lattice problems (extended abstract). In Proceedings of the 28th ACM Symposium on Theory of Computing (STOC). ACM, New York, 99-108.
4. 2 is NP-hard for randomized reductions (extended abstract) 10-19. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC). ACM, New York, 10-19.
5. AJTAI, M., AND DWORK, C. 1997. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC). ACM, New York, 284-293.
6. AJTAI, M., KUMAR, R., AND SIVAKUMAR, D. 2001. A sieve algorithm for the shortest lattice vector problem. In Proceedings of the 33rd ACM Symposium on Theory of Computing. ACM, New York, 601-610.
7. BANASZCZYK, W. 1993. New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 4, 625-635.
8. 0 functions, and spectral norms. SIAM J. Comput. 21, 1, 33-42.
9. CAI, J.-Y., AND NERURKAR, A. 2000. A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. Inform. Process. Lett. 76, 1-2, 61-66.
10. DINUR, I., KINDLER, G., RAZ, R., AND SAFRA, S. 2003. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica 23, 2, 205-243.
11. FEIGE, U., AND MICCIANCIO, D. 2002. The inapproximability of lattice and coding problems with preprocessing. In Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., 44-52.
12. GAUSS, C. F. 1801. Disquisitiones Arithmeticae. Gerh. Fleischer Iun.
13. GOLDREICH, O. 2003. A comment available online at http://www.wisdom. weizmann.ac.il/ ~oded/p_lp.html.
14. GOLDREICH, O., AND GOLDWASSER, S. 2000. On the limits of nonapproximability of lattice problems. J. Comput. System Sci. 60, 3, 540-563.
15. GOLDREICH, O., MICCIANCIO, D., SAFRA, S., AND SEIFERT, J.-P. 1999. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. Inform. Process. Lett. 71, 2, 55-61.
16. HÅSTAD, J., JUST, B., LAGARIAS, J. C., AND SCHNORR, C.-P. 1989. Polynomial time algorithms for finding integer relations among real numbers. SIAM J. Comput. 18, 5, 859-881.
17. HOEFFDING, W. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Stat. Assoc. 58, 13-30.
18. KANNAN, R. 1983. Improved algorithms for integer programming and related lattice problems. In Proceedings of the 15th ACM Symposium on Theory of Computing (STOC). ACM, New York, 193-206.
19. KERENIDIS, I., AND DE WOLF, R. 2003. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC). ACM, New York, 106-115.
20. KHOT, S. 2004. Hardness of approximating the shortest vector problem in lattices. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., 126-135.
21. KUSHILEVITZ, E., AND MANSOUR, Y. 1993. Learning decision trees using the fourier spectrum. SIAM J. Comput. 22, 6, 1331-1348.
22. LAGARIAS, J. C., LENSTRA, JR., H. W., AND SCHNORR, C.-P. 1990. Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica 10, 4, 333-348.
23. LENSTRA, A. K., LENSTRA, H. W., AND LOVÁSZ, L. 1982. Factoring polynomials with rational coefficients. Math. Ann. 261, 515-534.
24. MICCIANCIO, D. 2001. The shortest vector problem is NP-hard to approximate to within some constant. SIAM J. Comput. 30, 6 (Mar.), 2008-2035.
25. (Preliminary version in FOCS 1998.)
26. MICCIANCIO, D., AND GOLDWASSER, S. 2002. Complexity of Lattice Problems: A cryptographic perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston, Mass.
27. REGEV, O. 2003. Improved inapproximability of lattice and coding problems with preprocessing. In Proceedings of the of 18th IEEE Annual Conference on Computational Complexity (CCC). IEEE Computer Society Press, Los Alamitos, Calif., 363-370.
28. SCHNORR, C.-P. 1987. A hierarchy of polynomial time lattice basis reduction algorithms. Theoret. Comput. Sci. 53, 2-3, 201-224.
29. SCHNORR, C.-P. 1991. Factoring integers and computing discrete logarithms via diophantine approximation. In Proceedings of the of Eurocrypt '91. Vol. 547. Springer-Verlag, New York, 171-181.
30. STEIN, E. M., AND WEISS, G. 1971. Introduction to Fourier analysis on Euclidean spaces. Princeton University Press, Princeton, N.J. (Princeton Mathematical Series, No. 32.)
31. VAN EMDE BOAS, P. 1981. Another NP-complete problem and the complexity of computing short vectors in a lattice. Tech. rep., University of Amsterdam, Department of Mathematics, Netherlands. Technical Report 8104.
32. ŠTEFANKOVIČ, D. 2002. Fourier transforms in computer science. Master's Thesis, University of Chicago, Department of Computer Science, TR-2002-03.