LattE (Lattice point Enumeration) is computer software dedicated to the problems of counting and detecting lattice points inside convex polytopes, and the solution of integer programs. It contains an implementation of Barvinok's algorithm. LattE was developed in 2002/2003 by a team directed by J.A. De Loera at UC Davis. Current development (since 2006) takes place under the name "LattE macchiato".
Release Notes: A build problem on Solaris/SPARC using GCC 4.2.0 was fixed.
Release Notes: Improved portability, using GNU Autoconf and Automake. New and much faster algorithms: exponential substitution (count --exp), primal irrational decomposition (count --irr), non-unimodular enumeration (count --maxdet=N), and all-primal irrational decomposition (count --all-primal).
No changes have been submitted for this release.