LattE is free software dedicated to the problems of counting and detecting lattice points inside convex polytopes, and the solution of integer programs. LattE contains the first ever implementation of Barvinok’s algorithm. LattE stands for “Lattice point Enumeration.” LattE was developed by a team directed by Jesús A. De Loera at UC Davis. See the official LattE web site for more information.
LattE macchiato is an improved version of LattE, derived from the latest release 1.2. It contains the improvements listed below. It was developed from 2006 to 2010.
2011 News: LattE macchiato has now been superseded by the new LattE integrale, version 1.5, available at the LattE site.
Various micro-optimizations and code clean-ups make the code more robust and much faster than LattE.
For polyhedral computations, it can optionally use the library 4ti2 instead of CDD+ and cddlib. For many instances, this gives another big reduction in running time.
New algorithms are implemented:
A combination of these new algorithms is much faster (for some examples, by several orders of magnitude) than the traditional algorithms implemented in LattE.
Papers on the new algorithms implemented in LattE macchiato:
LattE "for tea, too", a source code distribution of LattE macchiato and 4ti2 and all required libraries:
When the compilation has finished (it does take a while), you can start using it:tar -xfz latte-for-tea-too-1.2-mk-0.9.3.tar.gz cd latte-for-tea-too-1.2-mk-0.9.3 ./configure make
Matthias Köppe (home page)
$Id: index.html,v 1.8 2007/11/02 05:44:53 mkoeppe Exp $