Download List

專案描述

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".

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2007-07-05 09:43
1.2-mk-0.8.1

A build problem on Solaris/SPARC using GCC 4.2.0
was fixed.
標籤: Macchiato, Minor bugfixes

2006-09-17 21:19
1.2-mk-0.6

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).
標籤: Macchiato, Major feature enhancements

2006-09-17 21:18
1.2

標籤: Official, Initial freshmeat announcement

Project Resources