whose vertices are elements of the lattice, the number of lattice points it contains is described by the polytope's Ehrhart polynomial. Formulas for some of the coefficients of this polynomial involve as well.

Computational lattice problems

Computational lattice problems have many applications in computer science. For example, the Lenstra-Lenstra-Lovász lattice basis reduction algorithm

1.Previous
3.Next