274 search results - page 3 / 55 » Counting lattice vectors |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional l...
IMA
1999
Springer
13 years 10 months ago
1999
Springer
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product. Using these trapdoors we set up a lattice-based cryptosystem which ...
MOC
1998
13 years 5 months ago
1998
We count lattice points in certain rational simplices associated with an irreducible finite Weyl group W and observe that these numbers are linked to the exponents of W .
COMBINATORICS
1999
13 years 5 months ago
1999
Abstract. We generalize Ehrhart's idea ([Eh]) of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n + 1...
ICCS
2003
Springer
13 years 11 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...