The worst-case behavior of Schnorr's algorithm approximating the shortest nonzero vector in a lattice

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 396-406

  Ajtai, Miklós ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Algorithm; Basis; Lattice

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; VECTORS;

LATTICE VECTOR;

HEURISTIC METHODS;

EID: 0038784608     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780602     Document Type: Conference Paper

References (12)

1. M. Ajtai, Generating Hard Instances of Lattice Problems, Proc. of 28th ACM STOC 1996 or Electronic Colloquium on Computational Complexity, 1996, http://www.eccc.uni-trier.de/eccc/
2. M. Ajtai, Random Lattices and a Conjectured 0 - 1 Law about their Polynomial Time Computable Properties, In Proc. of 43rd Annual Symposium on Foundations of Computer of Computer Science, IEEE, 2002. 733-742
3. M. Ajtai, R. Kumar, and D. Sivakumar, A Sieve Algorithm for the Shortest Lattice Vector Problem Proceedings of the Thirty-Third ACM Symposium on the Theory of Computing.
4. M. Furst and R Kannan. Succinct certificates for almost all subset problems SIAM Journal on Computing, Vol. 18 No. 3, pp 550-558, June (1989)
5. P. M. Gruber and C. G. Lekkerkerker. Geometry of Numbers, Chapter 3. North Holland 1987.
6. R. Kannan, Minkowski's convex body Theorem and Integer Programming, Mathematics of Operation Research, Vol. 12. No. 3, (1987), pp 415-440.
7. R. Kannan, Algorithmic Geometry of Numbers", Annual Review of Computer Science, Vol. 2, 1987 pp 231-269, (eds) Traub, Publ. Annual Reviews Inc.
8. A. K. Lenstra, H. W. Lenstra, L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261, 515-534 (1982).
9. J.C. Lagarias, A.M. Odlyzko (1983), Solving low-density subset sum problems, Journal of the Association for Computing Machinery 32 (1985) 229-246.
10. A. M. Odlyzko, H. te Riele, Disproof of the Mertens conjecture, Journal für die reine und angewandte Mathematik 357, (1985) 138-160.
11. C. P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53, (1987) 201-224.
12. C. P. Schnorr, Lattice Reduction by Random Sampling and Birthday Methods, STACS'03, Berlin, 2003