Counting lattice vectors

We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ♯Pcomplete resolving an open problem. Furthermore, we show that the problem is at least as hard as integer factorization even for lattices of bounded rank or lattices generated by vectors of bounded norm. Next, we discuss a deterministic algorithm for counting the number of lattice vectors of length d in time 2O(rs+log d) , where r is the rank of the lattice, s is the number of bits that encode the basis of the lattice. The algorithm is based on the theory of modular forms. Date: January 2005. Research supported in part by NSF grant CCR-9988202. A preliminary version of this work was presented as a contributed talk at the Banff conference in honour of Prof. Hugh C. Williams (May 2003). 1 

• Type: Journal
• Year: 2007
• Where: JCSS
• Authors: Denis Xavier Charles
• Keywords: Computational Complexity, JCSS 2007, Lattice Vectors, Open Problem